Thumbnail
Access Restriction
Subscribed

Author Sinclair, J. B. ♦ Hirschberg, D. S.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Operating systems ♦ Decentralized algorithms ♦ Distributed system
Abstract This note presents an efficient algorithm, requiring O(n log n) message passes, for finding the largest (or smallest) of a set of n uniquely numbered processors arranged in a circle, in which no central controller exists and the number of processors is not known a priori.
Description Affiliation: Rice Univ., Houston, TX (Hirschberg, D. S.; Sinclair, J. B.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 23
Issue Number 11
Page Count 2
Starting Page 627
Ending Page 628


Open content in new tab

   Open content in new tab
Source: ACM Digital Library