|
 ABSTRACT
This paper deals with the problem of finding the maximum of a distributed set of distinct integers. The problem is to be solved by a completely distributed asynchronous algorithm.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
J.E. Burns, A formal model for message passing systems, Tech. Report No. 91 (September 1980), Indiana University, Computer Science Dept.
|
 |
2
|
|
| |
3
|
D. Dolev, M. Klawe and M. Rodeh, An O(n log n) unidirectional distributed algorithm for extrema finding in a circle, IBM Research, RJ3185, to appear in the Journal of Algorithms.
|
| |
4
|
R.G. Gallager, Finding a leader in a network with 0(E) + 0(N log N) messages, M.I.T. Internal Memorandum.
|
| |
5
|
|
| |
6
|
G. Le Lann, Distributed systems-&-mdash; towards a formal approach, Information Processing 77 (ed. B. Gilchrist), pp. 155-160, North Holland, 1977.
|
| |
7
|
G.L. Peterson, An 0(n log n) unidirectional algorithm for the circular extrema problem, University of Rochester.
|
CITED BY 7
|
|
Alain Mayer , Yoram Ofek , Rafail Ostrovsky , Moti Yung, Self-stabilizing symmetry breaking in constant-space (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.667-678, May 04-06, 1992, Victoria, British Columbia, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf