- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for We (0.21 sec)
-
docs/distributed/DESIGN.md
many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*. In the example with 1024 drives - 4, 8, 16 are GCD factors. With 16 drives we get a total of 64 possible sets, with 8 drives we get a total of 128 possible sets, with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total. - *If total number of nodes are of odd number then GCD algorithm provides...
Plain Text - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Tue Aug 15 23:04:20 GMT 2023 - 8K bytes - Viewed (0) -
docs/bucket/replication/DESIGN.md
Plain Text - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Sep 29 04:28:45 GMT 2022 - 14.7K bytes - Viewed (0)