TIME AND MESSAGE BOUNDS FOR ELECTION IN SYNCHRONOUS AND ASYNCHRONOUS COMPLETE NETWORKS

被引:33
作者
AFEK, Y
GAFNI, E
机构
[1] AT&T BELL LABS,MURRAY HILL,NJ 07974
[2] UNIV CALIF LOS ANGELES,LOS ANGELES,CA 90024
关键词
DISTRIBUTED ALGORITHMS; LEADER ELECTION ALGORITHMS; COMPLETE NETWORKS; TIME-MESSAGE COMPLEXITIES TRADE-OFF;
D O I
10.1137/0220023
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper addresses the problem of distributively electing a leader in both synchronous and asynchronous complete networks. O(n log n) messages synchronous and asynchronous algorithms are presented. The time complexity of the synchronous algorithm is O(log n), while that of the asynchronous algorithm is O(n). In the synchronous case, a lower bound of OMEGA(n log n) on the message complexity is proven. It is also proven that any message-optimal synchronous algorithm requires OMEGA(log n) time. In proving these bounds, the type of operations performed by nodes are not restricted. The bounds thus apply to general algorithms and not just to comparison-based algorithms.
引用
收藏
页码:376 / 394
页数:19
相关论文
共 15 条
[1]   EFFICIENCY OF SYNCHRONOUS VERSUS ASYNCHRONOUS DISTRIBUTED SYSTEMS [J].
ARJOMANDI, E ;
FISCHER, MJ ;
LYNCH, NA .
JOURNAL OF THE ACM, 1983, 30 (03) :449-456
[2]  
AWERBUCH B, 1987, 19TH P ANN ACM S THE, P230
[3]  
BURNS JE, 1980, FORMAL MODEL MESSAGE
[4]   ELECTING A LEADER IN A SYNCHRONOUS RING [J].
FREDERICKSON, GN ;
LYNCH, NA .
JOURNAL OF THE ACM, 1987, 34 (01) :98-115
[5]  
FREDERICKSON GN, 1985, CSDTR512 PURD U COMP
[6]  
GAFNI E, 1985, 4TH P ANN ACM S PRIN
[7]   A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES [J].
GALLAGER, RG ;
HUMBLET, PA ;
SPIRA, PM .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01) :66-77
[8]  
GALLAGER RG, 1977, UNPUB FINDING LEADER
[9]  
HUMBLET PA, 1984, 23RD P IEEE C DEC CO, P1139
[10]  
KORACH E, 1985, 4TH P ACM S PRINC DI