Post #2741005
2026-05-11 15:21 UTC
"These paths cannot be edge-disjoint. But, for all-to-all broadcast, there is no contention between data packets moving along the paths generated by a … Gray code. Moreover, it can be shown that paths generated by rotating the address bits in the Gray code can be used without contention, thus providing n paths for each node. The initial data set M in each node is divided into n packets of approximately equal size. Each subset is then exchanged with packets in all neighboring nodes in each step."
Replies (1)
-
@theohonohan@graphics.social 2026-05-11 15:29
https://oeis.org/A007814: "Shows which bit to flip when creating the binary reflected Gray code (bits are numbered from the right, offset is 0). That is, A003188(n) XOR A003188(n+1) == 2^A007814(n). - Russ Cox, Dec 04 2010"