| TR#: | CS0389 |
| Class: | CS |
| Title: | A 1.44 ... NlogN Algorithm for Distributed Leader-Finding in Bidirectional Rings of Processors |
| Authors: | S. Moran, M. Shalom and S. Zaks |
| CS0389.pdf | |
| Abstract: | This work presents an algorithm for finding a leader in a bidirectional ring without a common sense of orientation, using at most 1.44... nlogn + O(n) messages. This improves the previous upper bound of 1.89... nlogn + O(n) messages. |
| Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1985/CS/CS0389), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1985
To the main CS technical reports page