TY - GEN

T1 - Time and message bounds for election in synchronous and asynchronous complete networks

AU - Afek, Yehuda

AU - Gafni, Eli

N1 - Publisher Copyright:
© 1985 ACM.

PY - 1985/8/1

Y1 - 1985/8/1

N2 - This paper addresses the problem of distributively electing a leader in both synchronous and asynchronous complete networks. In the synchronous case, we prove a lower bound of ft(n'logn) on the message complexity. We also prove that any message-optimal synchronous algorithm requires ?(log n) time. In proving these bounds we do not restrict the type of operations performed by nodes. The bounds thus apply to general algorithms and not just to comparison based algorithms. A simple algorithm which achieves these bounds is presented. In the asynchronous case, we present a sequence of three simple and efficient algorithms, each of which is an improvement on the previous. The third algorithm has time complexity O(n) and message complexity 2.n.logn+O(n), thus improving the time complexity of the previous best algorithm [Kor84] by a factor of logn.

AB - This paper addresses the problem of distributively electing a leader in both synchronous and asynchronous complete networks. In the synchronous case, we prove a lower bound of ft(n'logn) on the message complexity. We also prove that any message-optimal synchronous algorithm requires ?(log n) time. In proving these bounds we do not restrict the type of operations performed by nodes. The bounds thus apply to general algorithms and not just to comparison based algorithms. A simple algorithm which achieves these bounds is presented. In the asynchronous case, we present a sequence of three simple and efficient algorithms, each of which is an improvement on the previous. The third algorithm has time complexity O(n) and message complexity 2.n.logn+O(n), thus improving the time complexity of the previous best algorithm [Kor84] by a factor of logn.

UR - http://www.scopus.com/inward/record.url?scp=84990669314&partnerID=8YFLogxK

U2 - 10.1145/323596.323613

DO - 10.1145/323596.323613

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84990669314

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 186

EP - 195

BT - Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985

A2 - Strong, Ray

A2 - Malcolm, Michael

PB - Association for Computing Machinery

T2 - 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985

Y2 - 5 August 1985 through 7 August 1985

ER -