A leader election algorithm for an oriented hypercube
Posted
by mick
on Stack Overflow
See other posts from Stack Overflow
or by mick
Published on 2010-05-15T14:57:25Z
Indexed on
2010/05/15
15:24 UTC
Read the original article
Hit count: 430
I'm stuck with some problem where I have to design a leader election algorithm for an oriented hypercube. This should be done by using a tournament with a number of rounds equal to the dimension D of the hypercube. In each stage d, with 1 <= d < D two candidate leaders of neighbouring d-dimensional hypercubes should compete to become the single candidate leader of the (d+1)-dimensional hypercube that is the union of their respective hypercubes.
© Stack Overflow or respective owner