1984 · 76 citations · 8 references
ComputingCommunicationComputer ScienceComputer NetworksDistributed SystemsCommunication ComplexityCommunication OverheadDistributed ComputingLeader ElectionLower Bounds For Leader ElectionRing-based Leader ElectionSynchronous Communication ProtocolsSynchronous Distributed AlgorithmsSynchronous Leader ElectionUpper Bounds For Leader Election
We consider the problem of electing a leader in a synchronous ring of n processors. We obtain both positive and negative results.
8