论文信息 - A technique for proving lower bounds for distributed maximum-finding algorithms (Preliminary Version) - 字舞流文

A technique for proving lower bounds for distributed maximum-finding algorithms (Preliminary Version)

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.

Doron Rotem | Jan K. Pachl | Ephraim Korach

[1] Daniel S. Hirschberg,et al. Decentralized extrema-finding in circular configurations of processors , 1980, CACM.

[2] Ernest J. H. Chang,et al. An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.

[3] Gérard Le Lann,et al. Distributed Systems - Towards a Formal Approach , 1977, IFIP Congress.

[4] L PetersonGary. An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem , 1982 .

[5] Danny Dolev,et al. An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.