Simple, efficient, asynchronous parallel algorithms for maximization

Authors:
Albert G. Greenberg;Boris D. Lubachevsky;Andrew M. Odlyzko
Affiliations:
AT&T Bell Laboratories, Murray Hill, NJ;AT&T Bell Laboratories, Murray Hill, NJ;AT&T Bell Laboratories, Murray Hill, NJ
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1988

Citing 7
Cited 0

Cache memory optimization to reduce processor/memory traffic

Advances in VLSI and Computer Systems
Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors

ACM Transactions on Programming Languages and Systems (TOPLAS)
Real-Time Synchronization of Interprocess Communications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Finding an extremum in a network

ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Dynamic decentralized cache schemes for mimd parallel processors

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Coordinating parallel processors: a partial unification

ACM SIGARCH Computer Architecture News
Software structures for ultraparallel computing

Software structures for ultraparallel computing

Quantified Score

Hi-index	0.00

Visualization

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.