Access Restriction

Author Franklin, Randolph
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Distributed systems ♦ Decentralized algorithms
Abstract This note presents a more efficient algorithm for finding the largest element in a circular list of processors when messages can be passed in either direction. It passes 2N*floor(lg N) + 3N messages in the worst case, compared to Chang and Roberts' N(N + 1)/2 and Hirschberg and Sinclair's 8N + 8*ceiling(N lg N) messages. The technique is a selective elimination of possible processes, which then merely relay future messages between the remaining contenders.
Description Affiliation: Rensselaer Polytechnic Institute, Troy, NY (Franklin, Randolph)
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 25
Issue Number 5
Page Count 2
Starting Page 336
Ending Page 337

Open content in new tab

   Open content in new tab
Source: ACM Digital Library