Selecting a Leader in a Clique in O(N log N) Messages
- 1 September 1984
- report
- Published by Defense Technical Information Center (DTIC)
Abstract
This paper presents an extremely simple algorithm for all processors in a completely connected network to agree on a unique leader. It requires O(N log K) messages, where N is the number of processors, and K is the number of processors that independently start the algorithm.Keywords
This publication has 0 references indexed in Scilit: