skip to main content
article
Free Access

On an improved algorithm for decentralized extrema finding in circular configurations of processors

Published:01 May 1982Publication History
Skip Abstract Section

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.

References

  1. 1 Chang, E. and Roberts, R. An improved algorithm for decentralized extrema-finding in circular configurations of processes. Comm. ACM, 22, 5 (May 1979), 281-283. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Hirschberg, D.S. and Sinclair, J.B. Decentralized extrema-finding in circular configurations of processors. Comm. A CM, 23, 11 (Nov, 1980), 627-628. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On an improved algorithm for decentralized extrema finding in circular configurations of processors

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image Communications of the ACM
    Communications of the ACM  Volume 25, Issue 5
    May 1982
    32 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/358506
    Issue’s Table of Contents

    Copyright © 1982 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 May 1982

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader