Abstract
An improved version of Afek and Gafni's synchronous algorithm for distributed election in complete networks is given and anO(n) expected message complexity is shown.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Afek Y, Gafni E (1985) Time and message bounds for election in synchronous and asynchronous complete networks. Proc ACM Symp Principles Distributed Comput, Minacki, Ontario (August 1985) pp 186–195
Chan M-Y, Chin F (1986) Expected and worst performance for election in synchronous and asynchronous complete networks. Tech Rep TR-20-86, Centre of Computer Studies and Applications, University of Hong Kong (October 1986).
Humblet PA (1984) Selecting a leader in a clique inO(N logN) messages. Proc 23rd Conf on Decision and Control, Las Vegas, Nevada (December 1984) pp 1139–1140
Korach E, Moran S, Zaks S (1984) Tight lower and upper bounds for some distributed algorithms for a complete network of processors. Proc ACM Symp Principles Distributed Comput, Vancouver, BC (August 1984) pp 199–207
Pachl J, Korach E, Rotem D (1984) Lower bounds for distributed maximum-finding algorithms. J ACM 31:905–918
Author information
Authors and Affiliations
Additional information
M.Y. Chan received her Ph.D. in 1988 from the University of Hong Kong, and her M.S. and B.A. degrees in computer science from the University of California, San Diego in 1980 and 1981, respectively. She is currently an Assistant Professor at the University of Texas at Dallas.
Francis Y.L. Chin (S′71-M′76-SM″85) received the B.Sc. degree in engineering science from the University of Toronto, Toronto, Canada, in 1972, and the M.S., M.A., and Ph.D. degrees in electrical engineering and computer science from Princeton University, New Jersey, in 1974, 1975, and 1976, respectively. Since 1975, he has taught at the University of Maryland, Baltimore Country, University of California, San Diego, University of Alberta, and Chinese University of Hong Kong. He is currently Head of the Department of Computer Science, University of Hong Kong. He has served as a program co-chairman of the 1988 International Conference on Computer Processing of Chinese and Oriental Languages (Toronto) and the International Computer Science Conference '88 (Hong Kong). His current research interests include algorithm design and analysis, parallel and distributed computing.
Rights and permissions
About this article
Cite this article
Chan, M.Y., Chin, F.Y.L. Distributed election in complete networks. Distrib Comput 3, 19–22 (1988). https://doi.org/10.1007/BF01788564
Issue Date:
DOI: https://doi.org/10.1007/BF01788564