Commit graph

13 commits

Author SHA1 Message Date
Michael Whittaker
68a939b3e6 More efficently(?) check quorum system validity. 2021-01-22 14:51:44 -08:00
Michael Whittaker
7f1a1a3934 Split up code into separate modules. 2021-01-22 14:47:07 -08:00
Michael Whittaker
630effa405 Added duplicate free resilience computation. 2021-01-22 14:20:46 -08:00
Michael Whittaker
2d4bcc1a09 Raise error if there are no f-resilient quorums. 2021-01-22 12:10:43 -08:00
Michael Whittaker
6193204c7d Added f-resilient strategies. 2021-01-22 12:07:35 -08:00
Michael Whittaker
f6c291d844 Added option to pass write fraction. 2021-01-22 11:28:13 -08:00
Michael Whittaker
cf5e451d68 Added resilience computation. 2021-01-22 11:10:05 -08:00
Michael Whittaker
59b2e746a4 Added examples.py 2021-01-20 22:04:18 -08:00
Michael Whittaker
1b84ec3134 Added read and write capacity handling.
This stuff is weird because it's obvious how to adjust the LP, but
understanding what things mean intuitively is weird. I settled on the
new load being the inverse of the peak throughput possible. With default
load, we assume capacity at every node is 1.
2021-01-20 21:52:19 -08:00
Michael Whittaker
11fe478c2b Added optimal load strategy with LP. 2021-01-20 17:59:46 -08:00
Michael Whittaker
efbeb8dc44 Added some more skeleton around strategies. 2021-01-20 17:11:59 -08:00
Michael Whittaker
56992f1c8d Added Choose and QuorumSystem. 2021-01-20 16:41:09 -08:00
Michael Whittaker
3f28929d07 Added basic library skeleton. 2021-01-20 16:12:26 -08:00