Decentralized extrema-finding in circular configurations of processors
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…
Decentralized extrema-finding in circular configurations of processors
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved