Simple, efficient asynchronous parallel algorithms for maximization

Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

The problem of computing the maximum of n inputs on an asynchronous parallel computer is considered. In general, the inputs may arrive staggered in time, the number of processors available to the maximization algorithm may vary during its execution, and the number of inputs, n, may be initially unknown. Two simple, efficient algorithms to compute the maximum are presented. The algorithms may be invoked asynchronously, as new inputs and processors arrive. Performance measures that account for the response times of the invocations are introduced, and the algorithms are analyzed under these measures.

Original languageEnglish (US)
Title of host publicationProceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985
EditorsRay Strong, Michael Malcolm
PublisherAssociation for Computing Machinery
Pages300-308
Number of pages9
ISBN (Electronic)0897911687
DOIs
StatePublished - Aug 1 1985
Externally publishedYes
Event4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985 - Minaki, Canada
Duration: Aug 5 1985Aug 7 1985

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Other

Other4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985
CountryCanada
CityMinaki
Period8/5/858/7/85

Fingerprint Dive into the research topics of 'Simple, efficient asynchronous parallel algorithms for maximization'. Together they form a unique fingerprint.

Cite this