Simple, Efficient, Asynchronous Parallel Algorithms for Maximization

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

Research output: Contribution to journalArticle

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. Each algorithm 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)
Pages (from-to)313-337
Number of pages25
JournalACM Transactions on Programming Languages and Systems (TOPLAS)
Volume10
Issue number2
DOIs
StatePublished - Apr 1 1988

Keywords

  • Asynchronous algorithms
  • maximization
  • response times

Fingerprint Dive into the research topics of 'Simple, Efficient, Asynchronous Parallel Algorithms for Maximization'. Together they form a unique fingerprint.

  • Cite this