Affiliation:
1. Rice Univ., Houston, TX
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
129 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献