- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for gcd (0.18 sec)
-
docs/distributed/DESIGN.md
1024 drives. In this scenario 16 becomes the erasure set size. This is decided based on the greatest common divisor (GCD) of acceptable erasure set sizes ranging from *4 to 16*. - *If total drives has 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...
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) -
cmd/endpoint-ellipses.go
// all the ellipses sizes. func getDivisibleSize(totalSizes []uint64) (result uint64) { gcd := func(x, y uint64) uint64 { for y != 0 { x, y = y, x%y } return x } result = totalSizes[0] for i := 1; i < len(totalSizes); i++ { result = gcd(result, totalSizes[i]) } return result } // isValidSetSize - checks whether given count is a valid set size for erasure coding.
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Apr 11 21:22:47 GMT 2024 - 14.8K bytes - Viewed (0)