From 148cd266e3173bf052973a192b84d933193b6629 Mon Sep 17 00:00:00 2001 From: alexvanin Date: Mon, 14 Jan 2019 13:10:56 +0300 Subject: [PATCH] Initial commit --- Dockerfile | 18 ++ LICENSE.md | 675 ++++++++++++++++++++++++++++++++++++++++++++ Makefile | 7 + README.md | 56 ++++ data/3p.dat | 33 +++ go.mod | 1 + main.go | 128 +++++++++ model/model.go | 108 +++++++ model/model_test.go | 52 ++++ results.gp | 183 ++++++++++++ 10 files changed, 1261 insertions(+) create mode 100644 Dockerfile create mode 100644 LICENSE.md create mode 100644 Makefile create mode 100644 README.md create mode 100644 data/3p.dat create mode 100644 go.mod create mode 100644 main.go create mode 100644 model/model.go create mode 100644 model/model_test.go create mode 100644 results.gp diff --git a/Dockerfile b/Dockerfile new file mode 100644 index 0000000..d820436 --- /dev/null +++ b/Dockerfile @@ -0,0 +1,18 @@ +FROM golang:1.11-alpine3.8 as builder + +RUN apk add --no-cache git + +COPY . /bft-task-distrib-model + +WORKDIR /bft-task-distrib-model + +# https://github.com/golang/go/wiki/Modules#how-do-i-use-vendoring-with-modules-is-vendoring-going-away +# go build -mod=vendor +RUN set -x \ + && export CGO_ENABLED=0 \ + && go build -mod=vendor -o /go/bin/bft-task-distrib-model ./main.go + +# Executable image +FROM alpine:3.8 + +COPY --from=builder /go/bin/bft-task-distrib-model /usr/local/sbin/bft-task-distrib-model \ No newline at end of file diff --git a/LICENSE.md b/LICENSE.md new file mode 100644 index 0000000..2fb2e74 --- /dev/null +++ b/LICENSE.md @@ -0,0 +1,675 @@ +### GNU GENERAL PUBLIC LICENSE + +Version 3, 29 June 2007 + +Copyright (C) 2007 Free Software Foundation, Inc. + + +Everyone is permitted to copy and distribute verbatim copies of this +license document, but changing it is not allowed. + +### Preamble + +The GNU General Public License is a free, copyleft license for +software and other kinds of works. + +The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom +to share and change all versions of a program--to make sure it remains +free software for all its users. We, the Free Software Foundation, use +the GNU General Public License for most of our software; it applies +also to any other work released this way by its authors. You can apply +it to your programs, too. + +When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + +To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you +have certain responsibilities if you distribute copies of the +software, or if you modify it: responsibilities to respect the freedom +of others. + +For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + +Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + +For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + +Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the +manufacturer can do so. This is fundamentally incompatible with the +aim of protecting users' freedom to change the software. The +systematic pattern of such abuse occurs in the area of products for +individuals to use, which is precisely where it is most unacceptable. +Therefore, we have designed this version of the GPL to prohibit the +practice for those products. If such problems arise substantially in +other domains, we stand ready to extend this provision to those +domains in future versions of the GPL, as needed to protect the +freedom of users. + +Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish +to avoid the special danger that patents applied to a free program +could make it effectively proprietary. To prevent this, the GPL +assures that patents cannot be used to render the program non-free. + +The precise terms and conditions for copying, distribution and +modification follow. + +### TERMS AND CONDITIONS + +#### 0. Definitions. + +"This License" refers to version 3 of the GNU General Public License. + +"Copyright" also means copyright-like laws that apply to other kinds +of works, such as semiconductor masks. + +"The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + +To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of +an exact copy. The resulting work is called a "modified version" of +the earlier work or a work "based on" the earlier work. + +A "covered work" means either the unmodified Program or a work based +on the Program. + +To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + +To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user +through a computer network, with no transfer of a copy, is not +conveying. + +An interactive user interface displays "Appropriate Legal Notices" to +the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + +#### 1. Source Code. + +The "source code" for a work means the preferred form of the work for +making modifications to it. "Object code" means any non-source form of +a work. + +A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + +The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + +The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + +The Corresponding Source need not include anything that users can +regenerate automatically from other parts of the Corresponding Source. + +The Corresponding Source for a work in source code form is that same +work. + +#### 2. Basic Permissions. + +All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + +You may make, run and propagate covered works that you do not convey, +without conditions so long as your license otherwise remains in force. +You may convey covered works to others for the sole purpose of having +them make modifications exclusively for you, or provide you with +facilities for running those works, provided that you comply with the +terms of this License in conveying all material for which you do not +control copyright. Those thus making or running the covered works for +you must do so exclusively on your behalf, under your direction and +control, on terms that prohibit them from making any copies of your +copyrighted material outside their relationship with you. + +Conveying under any other circumstances is permitted solely under the +conditions stated below. Sublicensing is not allowed; section 10 makes +it unnecessary. + +#### 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + +No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + +When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such +circumvention is effected by exercising rights under this License with +respect to the covered work, and you disclaim any intention to limit +operation or modification of the work as a means of enforcing, against +the work's users, your or third parties' legal rights to forbid +circumvention of technological measures. + +#### 4. Conveying Verbatim Copies. + +You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + +You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + +#### 5. Conveying Modified Source Versions. + +You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these +conditions: + +- a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. +- b) The work must carry prominent notices stating that it is + released under this License and any conditions added under + section 7. This requirement modifies the requirement in section 4 + to "keep intact all notices". +- c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. +- d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + +A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + +#### 6. Conveying Non-Source Forms. + +You may convey a covered work in object code form under the terms of +sections 4 and 5, provided that you also convey the machine-readable +Corresponding Source under the terms of this License, in one of these +ways: + +- a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. +- b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the Corresponding + Source from a network server at no charge. +- c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. +- d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. +- e) Convey the object code using peer-to-peer transmission, + provided you inform other peers where the object code and + Corresponding Source of the work are being offered to the general + public at no charge under subsection 6d. + +A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + +A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, +family, or household purposes, or (2) anything designed or sold for +incorporation into a dwelling. In determining whether a product is a +consumer product, doubtful cases shall be resolved in favor of +coverage. For a particular product received by a particular user, +"normally used" refers to a typical or common use of that class of +product, regardless of the status of the particular user or of the way +in which the particular user actually uses, or expects or is expected +to use, the product. A product is a consumer product regardless of +whether the product has substantial commercial, industrial or +non-consumer uses, unless such uses represent the only significant +mode of use of the product. + +"Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to +install and execute modified versions of a covered work in that User +Product from a modified version of its Corresponding Source. The +information must suffice to ensure that the continued functioning of +the modified object code is in no case prevented or interfered with +solely because modification has been made. + +If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + +The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or +updates for a work that has been modified or installed by the +recipient, or for the User Product in which it has been modified or +installed. Access to a network may be denied when the modification +itself materially and adversely affects the operation of the network +or violates the rules and protocols for communication across the +network. + +Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + +#### 7. Additional Terms. + +"Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + +When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + +Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders +of that material) supplement the terms of this License with terms: + +- a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or +- b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or +- c) Prohibiting misrepresentation of the origin of that material, + or requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or +- d) Limiting the use for publicity purposes of names of licensors + or authors of the material; or +- e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or +- f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions + of it) with contractual assumptions of liability to the recipient, + for any liability that these contractual assumptions directly + impose on those licensors and authors. + +All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + +If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + +Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; the +above requirements apply either way. + +#### 8. Termination. + +You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + +However, if you cease all violation of this License, then your license +from a particular copyright holder is reinstated (a) provisionally, +unless and until the copyright holder explicitly and finally +terminates your license, and (b) permanently, if the copyright holder +fails to notify you of the violation by some reasonable means prior to +60 days after the cessation. + +Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + +Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + +#### 9. Acceptance Not Required for Having Copies. + +You are not required to accept this License in order to receive or run +a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + +#### 10. Automatic Licensing of Downstream Recipients. + +Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + +An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + +You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + +#### 11. Patents. + +A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + +A contributor's "essential patent claims" are all patent claims owned +or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + +Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + +In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + +If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + +If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + +A patent license is "discriminatory" if it does not include within the +scope of its coverage, prohibits the exercise of, or is conditioned on +the non-exercise of one or more of the rights that are specifically +granted under this License. You may not convey a covered work if you +are a party to an arrangement with a third party that is in the +business of distributing software, under which you make payment to the +third party based on the extent of your activity of conveying the +work, and under which the third party grants, to any of the parties +who would receive the covered work from you, a discriminatory patent +license (a) in connection with copies of the covered work conveyed by +you (or copies made from those copies), or (b) primarily for and in +connection with specific products or compilations that contain the +covered work, unless you entered into that arrangement, or that patent +license was granted, prior to 28 March 2007. + +Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + +#### 12. No Surrender of Others' Freedom. + +If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under +this License and any other pertinent obligations, then as a +consequence you may not convey it at all. For example, if you agree to +terms that obligate you to collect a royalty for further conveying +from those to whom you convey the Program, the only way you could +satisfy both those terms and this License would be to refrain entirely +from conveying the Program. + +#### 13. Use with the GNU Affero General Public License. + +Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + +#### 14. Revised Versions of this License. + +The Free Software Foundation may publish revised and/or new versions +of the GNU General Public License from time to time. Such new versions +will be similar in spirit to the present version, but may differ in +detail to address new problems or concerns. + +Each version is given a distinguishing version number. If the Program +specifies that a certain numbered version of the GNU General Public +License "or any later version" applies to it, you have the option of +following the terms and conditions either of that numbered version or +of any later version published by the Free Software Foundation. If the +Program does not specify a version number of the GNU General Public +License, you may choose any version ever published by the Free +Software Foundation. + +If the Program specifies that a proxy can decide which future versions +of the GNU General Public License can be used, that proxy's public +statement of acceptance of a version permanently authorizes you to +choose that version for the Program. + +Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + +#### 15. Disclaimer of Warranty. + +THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT +WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT +LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR +A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND +PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE +DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR +CORRECTION. + +#### 16. Limitation of Liability. + +IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR +CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, +INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES +ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT +NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR +LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM +TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER +PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. + +#### 17. Interpretation of Sections 15 and 16. + +If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + +END OF TERMS AND CONDITIONS + +### How to Apply These Terms to Your New Programs + +If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these +terms. + +To do so, attach the following notices to the program. It is safest to +attach them to the start of each source file to most effectively state +the exclusion of warranty; and each file should have at least the +"copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper +mail. + +If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands \`show w' and \`show c' should show the +appropriate parts of the General Public License. Of course, your +program's commands might be different; for a GUI interface, you would +use an "about box". + +You should also get your employer (if you work as a programmer) or +school, if any, to sign a "copyright disclaimer" for the program, if +necessary. For more information on this, and how to apply and follow +the GNU GPL, see . + +The GNU General Public License does not permit incorporating your +program into proprietary programs. If your program is a subroutine +library, you may consider it more useful to permit linking proprietary +applications with the library. If this is what you want to do, use the +GNU Lesser General Public License instead of this License. But first, +please read . diff --git a/Makefile b/Makefile new file mode 100644 index 0000000..b286df8 --- /dev/null +++ b/Makefile @@ -0,0 +1,7 @@ +.PHONY: build up + +build: + @docker build . -t bft-task-distrib-model-image + +up: build + @docker run -it --rm bft-task-distrib-model-image:latest diff --git a/README.md b/README.md new file mode 100644 index 0000000..1695063 --- /dev/null +++ b/README.md @@ -0,0 +1,56 @@ +# BFT task distribution model +Simulation model for task pool size calculation. + +## Description +This model allows to perform experiments of task distribution process in +bft environment. Model has 3 parameters: +- number of nodes `-n` +- number of tasks `-v` +- precision (number of experiments) `-e` + +Model produces size of node's task pool for chosen precision. + +Detailed information about task distribution problem can be found on +medium paper. + + +## Usage +You can run model inside a docker container or run app manually with +`go run`. Don't forget to turn on gomodules in that case! + +``` +$ make up +Sending build context to Docker daemon 114.7kB +. . . +/ # +/ # bft-task-distrib-model -n 10 -v 100 -e 1000 +# BFT TASK DISTRIBUTION MODEL v.1.0 +# N = 10 V = 100 +# EXP = 1000 +# AVAILABLE WORKERS = 8 +# STARTING AT: 2019-01-14T09:49:00Z +3:67 (1.000) 1(1) +6:50 (0.980) 2(2) +9:45 (1.000) 1(1) +# ENDED AT: 2019-01-14T09:49:00Z +# DURATION: 40.430027ms +``` + +Output string `3:67 (1.000) 1(1)` means, that for `3` nodes, pool +size must be `67` tasks. + +Relation between max pool size and obtained pool size is +`1.000` - so they equal. + +Last column is a number of tries to reduce pool size. + +There is also gnuplot file with example from medium paper: +``` +$ gnuplot +Terminal type is now 'qt' +gnuplot> load 'results.gp' +``` + +## License +This project is licensed under the GPLv3 License - +see the [LICENSE.md](LICENSE.md) file for details diff --git a/data/3p.dat b/data/3p.dat new file mode 100644 index 0000000..54cd0a5 --- /dev/null +++ b/data/3p.dat @@ -0,0 +1,33 @@ +3 667 667 667 667 667 0 1 +6 501 500 500 500 500 0 0.998004 +9 445 443 443 443 443 0 0.995506 +12 417 415 415 415 415 0 0.995204 +15 401 399 399 399 399 0 0.995012 +18 389 387 387 387 387 0 0.994859 +21 381 378 379 379 378.666666666667 1.43421757658316 0.993876 +24 376 374 373 373 373.333333333333 1.43421757658316 0.992908 +27 371 354 353 359 355.333333333333 7.98538551144413 0.957772 +30 367 342 341 343 342 2.48413771175033 0.93188 +33 364 339 331 325 331.666666666667 17.4480098702703 0.911172 +36 362 319 307 322 316 19.7172318231853 0.872928 +39 359 303 292 306 300.333333333333 18.3108642419671 0.836583 +42 358 278 279 276 277.666666666667 3.79458303359676 0.775605 +45 356 258 266 269 264.333333333333 14.1254049686041 0.742509 +48 355 250 259 262 257 15.5134350376268 0.723944 +51 353 244 267 268 259.666666666667 33.7269917352552 0.7356 +54 352 258 270 238 255.333333333333 40.1580921443283 0.725379 +57 351 225 242 229 232 22.0794989414224 0.660969 +60 351 210 220 244 224.666666666667 43.4073004481243 0.640076 +63 350 202 212 224 212.666666666667 27.3631273932776 0.607619 +66 349 197 208 233 212.666666666667 45.8276841895446 0.60936 +69 348 191 188 197 192 11.3837491007903 0.551724 +72 348 200 187 207 198 25.2112442693104 0.568966 +75 347 182 181 192 185 15.1104197931357 0.533141 +78 347 170 178 173 173.666666666667 10.0395230360821 0.50048 +81 346 164 172 167 167.666666666667 10.0395230360821 0.484586 +84 346 155 173 152 160 28.2143807667523 0.462428 +87 345 190 157 180 175.666666666667 42.035055239001 0.509179 +90 345 167 157 159 161 13.1448212154569 0.466667 +93 345 144 157 163 154.666666666667 24.1272741130314 0.448309 +96 344 136 152 142 143.333333333333 20.0790460721642 0.416667 +99 344 149 149 139 145.666666666667 14.3421757658315 0.42345 diff --git a/go.mod b/go.mod new file mode 100644 index 0000000..a91374d --- /dev/null +++ b/go.mod @@ -0,0 +1 @@ +module bft-task-distrib-model diff --git a/main.go b/main.go new file mode 100644 index 0000000..ea13e75 --- /dev/null +++ b/main.go @@ -0,0 +1,128 @@ +package main + +import ( + "flag" + "fmt" + "os" + "runtime" + "strconv" + "sync" + "time" + . "bft-task-distrib-model/model" +) + +type ( + result struct { + mu *sync.Mutex + unused int + } +) + +func newResult() *result { + return &result{ + mu: new(sync.Mutex), + unused: 0, + } +} + +func calcPool(n, v int) int { + return (((n/3 + 1) * v) / n) + 1 +} + +func calcBad(n int) int { + return n / 3 +} + +func worker(job chan struct{}, group *sync.WaitGroup, r *result, N, V, B, S int) { + defer func() { + group.Done() + }() + for range job { + res := ExecuteModelB(N, V, B, S) + r.mu.Lock() + r.unused += res.ViolatedCounter + r.mu.Unlock() + } +} + +func ParallelExperiment(N, V, B, experiments, step int) int { + var ( + workerCount = runtime.NumCPU() //+ runtime.NumCPU()/2 + wg = new(sync.WaitGroup) + r = newResult() + ) + wg.Add(workerCount) + + jobs := make(chan struct{}, experiments) + for i := 0; i < experiments; i++ { + jobs <- struct{}{} + } + + for i := 0; i < workerCount; i++ { + go worker(jobs, wg, r, N, V, B, step) + } + close(jobs) + wg.Wait() + return r.unused +} + +func main() { + var ( + Nodes *int + Experiments *int + Tasks *int + + n int + total int + rate float64 + st time.Time + version = "1.0" + ) + + Tasks = flag.Int("v", 1000, "number of tasks to split") + Experiments = flag.Int("e", 100000, "number of tasks to split") + Nodes = flag.Int("n", 100, "maximum number of nodes") + flag.Parse() + st = time.Now() + + if *Nodes < 3 { + fmt.Println("error: number of nodes must be greater than 3") + os.Exit(1) + } + if *Tasks < *Nodes { + fmt.Println("error: number of tasks must be greater than number of nodes") + os.Exit(1) + } + if *Experiments < 1 { + fmt.Println("error: number of experiments must be positive number") + os.Exit(1) + } + + fmt.Println("# BFT TASK DISTRIBUTION MODEL v." + version) + fmt.Println("# N = " + strconv.Itoa(*Nodes) + " V = " + strconv.Itoa(*Tasks)) + fmt.Println("# EXP = " + strconv.Itoa(*Experiments)) + fmt.Println("# AVAILABLE WORKERS = " + strconv.Itoa(runtime.NumCPU())) + fmt.Println("# STARTING AT: " + st.Format(time.RFC3339)) + + for N := 3; N <= *Nodes; N += 3 { // step 3 because for every 3 query there will be spike + badNodes := calcBad(N) + maxStep := calcPool(N, *Tasks) + n = (n / 3) * 2 + //n = n / 2 + startn := n + enoughStep := maxStep - n + for step := enoughStep; step > 0; step -= 1 { + total = ParallelExperiment(N, *Tasks, badNodes, *Experiments, step) + if total == 0 { + enoughStep = step + n++ + } else { + rate = float64(enoughStep) / float64(maxStep) + fmt.Printf("%d:%d (%.3f) %d(%d)\n", N, enoughStep, rate, n, n-startn) + break + } + } + } + fmt.Println("# ENDED AT: " + time.Now().Format(time.RFC3339)) + fmt.Println("# DURATION: " + time.Since(st).String()) +} diff --git a/model/model.go b/model/model.go new file mode 100644 index 0000000..1f69643 --- /dev/null +++ b/model/model.go @@ -0,0 +1,108 @@ +package model + +import ( + "math/rand" + "time" +) + +type ( + Node struct { + IR []int + } + ExperimentResult struct { + ViolatedCounter int + } +) + +func getRandomN(n, max, seed int, r *rand.Rand) []int { + r.Seed(time.Now().UnixNano() + int64(seed)) + + if n > max/2 { + return r.Perm(max)[:n] + + } else { + result := make([]int, 0, n) + re := make(map[int]struct{}, max) + + for len(result) < n { + num := r.Intn(max) + if _, ok := re[num]; !ok { + result = append(result, num) + re[num] = struct{}{} + } + } + return result + } +} + +func ExecuteModelA(ircount, containers, badcount, choose int) *ExperimentResult { + var ( + nodes = make([]Node, containers) + badring = make(map[int]struct{}) + result = new(ExperimentResult) + ) + + r := rand.New(rand.NewSource(time.Now().UnixNano())) + for len(badring) < badcount { + n := r.Intn(ircount) + if _, ok := badring[n]; !ok { + badring[n] = struct{}{} + } + } + + for i := 0; i < ircount; i++ { + if _, ok := badring[i]; ok { + continue + } + rands := getRandomN(choose, containers, i+1, r) + for _, host := range rands { + nodes[host].IR = append(nodes[host].IR, i) + } + } + + for _, node := range nodes { + if len(node.IR) == 0 { + result.ViolatedCounter++ + } + } + + return result +} + +func ExecuteModelB(ircount, containers, badcount, choose int) *ExperimentResult { + var ( + nodes = make([]Node, containers) + badring = make(map[int]struct{}) + result = new(ExperimentResult) + ) + r := rand.New(rand.NewSource(time.Now().UnixNano())) + + for len(badring) < badcount { + n := r.Intn(ircount) + if _, ok := badring[n]; !ok { + badring[n] = struct{}{} + } + } + + for i := 0; i < ircount; i++ { + if _, ok := badring[i]; ok { + continue + } + ind := (i * choose) % containers + for j := 0; j < choose; j++ { + nodes[ind].IR = append(nodes[ind].IR, i) + ind++ + if ind == containers { + ind = 0 + } + } + } + + for _, node := range nodes { + if len(node.IR) == 0 { + result.ViolatedCounter++ + } + } + + return result +} diff --git a/model/model_test.go b/model/model_test.go new file mode 100644 index 0000000..d7aeb60 --- /dev/null +++ b/model/model_test.go @@ -0,0 +1,52 @@ +package model + +import ( + "fmt" + "math/rand" + "testing" +) + +func TestGetRandom_A(t *testing.T) { + src := rand.NewSource(0) + t.Log(getRandomN(1, 10, 1, rand.New(src))) + t.Log(getRandomN(1, 10, 1, rand.New(src))) + t.Log(getRandomN(1, 10, 2, rand.New(src))) +} + +func TestExecuteModelA(t *testing.T) { + var ( + avg float32 + nExperiments = 10000 + results = make([]*ExperimentResult, nExperiments) + + totalNodes = 10 + tasks = 100 + badNodes = 3 + taskPoolSize = 33 + ) + for i := 0; i < nExperiments; i++ { + results[i] = ExecuteModelA(totalNodes, tasks, badNodes, taskPoolSize) + avg += float32(results[i].ViolatedCounter) + } + avg = avg / float32(nExperiments) + fmt.Printf("(%d) V=%d N=%d/%d AvgFailedV = %f (%.2f%%)\n", nExperiments, tasks, totalNodes, badNodes, avg, avg/float32(tasks)*100.00) +} + +func TestExecuteModelB(t *testing.T) { + var ( + avg float32 + nExperiments = 10000 + results = make([]*ExperimentResult, nExperiments) + + totalNodes = 10 + tasks = 100 + badNodes = 3 + taskPoolSize = 33 + ) + for i := 0; i < nExperiments; i++ { + results[i] = ExecuteModelB(totalNodes, tasks, badNodes, taskPoolSize) + avg += float32(results[i].ViolatedCounter) + } + avg = avg / float32(nExperiments) + fmt.Printf("(%d) V=%d N=%d/%d AvgFailedV = %f (%.2f%%)\n", nExperiments, tasks, totalNodes, badNodes, avg, avg/float32(tasks)*100.00) +} diff --git a/results.gp b/results.gp new file mode 100644 index 0000000..b46d31a --- /dev/null +++ b/results.gp @@ -0,0 +1,183 @@ +#!/usr/bin/gnuplot -persist +# +# +# G N U P L O T +# Version 5.2 patchlevel 2 last modified 2017-11-01 +# +# Copyright (C) 1986-1993, 1998, 2004, 2007-2017 +# Thomas Williams, Colin Kelley and many others +# +# gnuplot home: http://www.gnuplot.info +# faq, bugs, etc: type "help FAQ" +# immediate help: type "help" (plot window: hit 'h') +# set terminal qt 0 font "Sans,9" +# set output +unset clip points +set clip one +unset clip two +set errorbars front 1.000000 +set border 31 front lt black linewidth 1.500 dashtype solid +set zdata +set ydata +set xdata +set y2data +set x2data +set boxwidth +set style fill empty border +set style rectangle back fc bgnd fillstyle solid 1.00 border lt -1 +set style circle radius graph 0.02 +set style ellipse size graph 0.05, 0.03 angle 0 units xy +set dummy x, y +set format x "% h" +set format y "% h" +set format x2 "% h" +set format y2 "% h" +set format z "% h" +set format cb "% h" +set format r "% h" +set ttics format "% h" +set timefmt "%d/%m/%y,%H:%M" +set angles radians +set tics back +unset grid +unset raxis +set theta counterclockwise right +set style parallel front lt black linewidth 2.000 dashtype solid +set key title "" center +set key fixed right top vertical Right noreverse enhanced autotitle nobox +set key noinvert samplen 4 spacing 1 width 0 height 0 +set key maxcolumns 0 maxrows 0 +set key noopaque +unset label +unset arrow +set style increment default +unset style line +unset style arrow +set style histogram clustered gap 2 title textcolor lt -1 +unset object +set style textbox transparent margins 1.0, 1.0 border lt -1 linewidth 1.0 +set offsets 0, 0, 0, 0 +set pointsize 1 +set pointintervalbox 1 +set encoding default +unset polar +unset parametric +unset decimalsign +unset micro +unset minussign +set view 60, 30, 1, 1 +set view azimuth 0 +set rgbmax 255 +set samples 100, 100 +set isosamples 10, 10 +set surface +unset contour +set cntrlabel format '%8.3g' font '' start 5 interval 20 +set mapping cartesian +set datafile separator whitespace +unset hidden3d +set cntrparam order 4 +set cntrparam linear +set cntrparam levels auto 5 +set cntrparam points 5 +set size ratio 0 1,1 +set origin 0,0 +set style data points +set style function lines +unset xzeroaxis +unset yzeroaxis +unset zzeroaxis +unset x2zeroaxis +unset y2zeroaxis +set xyplane relative 0.5 +set tics scale 1, 0.5, 1, 1, 1 +set mxtics default +set mytics default +set mztics default +set mx2tics default +set my2tics default +set mcbtics default +set mrtics default +set nomttics +set xtics border in scale 1,0.5 mirror norotate autojustify +set xtics norangelimit autofreq +set ytics border in scale 1,0.5 mirror norotate autojustify +set ytics norangelimit autofreq +set ztics border in scale 1,0.5 nomirror norotate autojustify +set ztics norangelimit autofreq +unset x2tics +set y2tics border in scale 1,0.5 nomirror norotate autojustify +set y2tics norangelimit autofreq +set cbtics border in scale 1,0.5 mirror norotate autojustify +set cbtics norangelimit autofreq +set rtics axis in scale 1,0.5 nomirror norotate autojustify +set rtics norangelimit autofreq +unset ttics +set title "Node's pool of tasks, with total tasks V = 1000" +set title font "" norotate +set timestamp bottom +set timestamp "" +set timestamp font "" norotate +set trange [ * : * ] noreverse nowriteback +set urange [ * : * ] noreverse nowriteback +set vrange [ * : * ] noreverse nowriteback +set xlabel "N, nodes" +set xlabel font "" textcolor lt -1 norotate +set x2label "" +set x2label font "" textcolor lt -1 norotate +set xrange [ 3.00000 : 100.000 ] noreverse nowriteback +set x2range [ * : * ] noreverse nowriteback +set ylabel "PoolSize, tasks" +set ylabel font "" textcolor lt -1 rotate +set y2label "Difference between maximum and actual pool sizes" +set y2label font "" textcolor lt -1 rotate +set yrange [ 0.00000 : 1000.00 ] noreverse nowriteback +set y2range [ 0.00000 : 1.10000 ] noreverse nowriteback +set zlabel "" +set zlabel font "" textcolor lt -1 norotate +set zrange [ * : * ] noreverse nowriteback +set cblabel "" +set cblabel font "" textcolor lt -1 rotate +set cbrange [ * : * ] noreverse nowriteback +set rlabel "" +set rlabel font "" textcolor lt -1 norotate +set rrange [ * : * ] noreverse nowriteback +unset logscale +unset jitter +set zero 1e-08 +set lmargin -1 +set bmargin -1 +set rmargin -1 +set tmargin -1 +set locale "ru_RU.UTF-8" +set pm3d explicit at s +set pm3d scansautomatic +set pm3d interpolate 1,1 flush begin noftriangles noborder corners2color mean +set pm3d nolighting +set palette positive nops_allcF maxcolors 0 gamma 1.5 color model RGB +set palette rgbformulae 7, 5, 15 +set colorbox default +set colorbox vertical origin screen 0.9, 0.2 size screen 0.05, 0.6 front noinvert bdefault +set style boxplot candles range 1.50 outliers pt 7 separation 1 labels auto unsorted +set loadpath +set fontpath +set psdir +set fit brief errorvariables nocovariancevariables errorscaling prescale nowrap v5 +FindPoolFloored(n,v) = (floor(v) * (1 + floor(floor(n)/3) )) / floor(n) +FindPool(n,v) = (v * (1 + (n/3) )) / n +FindMinPool(n,v) = v / (2*(n/3)) +R(x) = 0.9635163499025019 + 0.008489300057147832*x - 0.0004128065185341778*x**2 + 0.00000231445380908552*x**3 + 2.263099444192e-8*x**4 - 1.8532019602e-10*x**5 +RCeil(x)=ceil(R(x)*100)/100.0 +Result(n,v)= n<90 ? R(n)*FindPool(n,v) : R2(n)*FindPool(n,v) +R2(x) = 1.1821374025608*exp(-0.01032913015671078175*x) +GNUTERM = "qt" +GPFUN_FindPoolFloored = "FindPoolFloored(n,v) = (floor(v) * (1 + floor(floor(n)/3) )) / floor(n)" +GPFUN_FindPool = "FindPool(n,v) = (v * (1 + (n/3) )) / n" +GPFUN_FindMinPool = "FindMinPool(n,v) = v / (2*(n/3))" +GPFUN_R = "R(x) = 0.9635163499025019 + 0.008489300057147832*x - 0.0004128065185341778*x**2 + 0.00000231445380908552*x**3 + 2.263099444192e-8*x**4 - 1.8532019602e-10*x**5" +GPFUN_RCeil = "RCeil(x)=ceil(R(x)*100)/100.0" +GPFUN_Result = "Result(n,v)= n<90 ? R(n)*FindPool(n,v) : R2(n)*FindPool(n,v)" +GPFUN_R2 = "R2(x) = 1.1821374025608*exp(-0.01032913015671078175*x)" +## Last datafile plotted: "data/3p.dat" +plot FindPool(x,1000) title 'MaxPoolSize', 'data/3p.dat' using 1:6:7 title 'Experiments' with yerrorbars, 'data/3p.dat' using 1:8 title 'diff' smooth bezier axes x1y2, FindMinPool(x,1000) title 'MinPoolSize', Result(x,1000) lt 2 title 'PoolSize' +# EOF