Access Restriction

Author Roberts, Rosemary ♦ Chang, Ernest
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Operating systems ♦ Distributed systems ♦ Decentralized algorithms
Abstract This note presents an improvement to LeLann's algorithm for finding the largest (or smallest) of a set of uniquely numbered processes arranged in a circle, in which no central controller exists and the number of processes is not known a priori. This decentralized algorithm uses a technique of selective message extinction in order to achieve an average number of message passes of order (n log n) rather than O(n2).
Description Affiliation: Univ. of Toronto, Toronto, Ont., Canada (Chang, Ernest) || Univ. of Waterloo, Ontario, Canada (Roberts, Rosemary)
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 22
Issue Number 5
Page Count 3
Starting Page 281
Ending Page 283

Open content in new tab

   Open content in new tab
Source: ACM Digital Library