Valiant's maximum algorithm with sequential memory accesses. Technical report
Technical Report
·
OSTI ID:6265203
This paper examines the performance of Valiant's PRAM algorithm for finding the maximum of a set of numbers, assuming that a modified PRAM model is used. The modified PRAM is like a standard CRCW PRAM, except that multiple read or write requests to a single memory location are handled sequentially. It is shown that using this model, Valiant's algorithm requires O(sqrt(N)) time to find the maximum of N numbers using N processors, and that it does require time proportional to sqrt(N) infinitely often.
- Research Organization:
- Washington Univ., Seattle (USA). Dept. of Computer Science
- OSTI ID:
- 6265203
- Report Number(s):
- AD-A-203713/3/XAB; TR-88-03-08
- Country of Publication:
- United States
- Language:
- English
Similar Records
Simulation of parallel random access machines by circuits
Parallel algorithms for maximum bipartite matchings and maximum 0-1 flows
A lower bound for the QRQW PRAM
Journal Article
·
Tue May 01 00:00:00 EDT 1984
· SIAM J. Comput.; (United States)
·
OSTI ID:6300636
Parallel algorithms for maximum bipartite matchings and maximum 0-1 flows
Journal Article
·
Tue Jan 31 23:00:00 EST 1989
· Journal of Parallel and Distributed Computing; (USA)
·
OSTI ID:5213761
A lower bound for the QRQW PRAM
Conference
·
Tue May 02 00:00:00 EDT 1995
·
OSTI ID:93994