Parallel searching and merging on ZMOB. Technical report
Technical Report
·
OSTI ID:6231896
One of the most difficult issues that must be addressed when studying a class of parallel algorithms is the problem of choosing a model that captures the inherent difficulty of implementing these algorithms on a multiprocessor architecture. Shared memory models have proven to be an effective tool for deriving lower bounds on the complexity of comparison problems. In particular, a speed-up of lg(P) is possible for the problem of finding an element in an N-element sorted list, and speed-ups of PlglgP and P are possible for merging N-element sorted lists of P processors for the cases N=P and P
- Research Organization:
- Maryland Univ., College Park (USA). Center for Automation Research
- OSTI ID:
- 6231896
- Report Number(s):
- AD-A-145424/8; CSC-TR-1405
- Country of Publication:
- United States
- Language:
- English
Similar Records
Searching, merging, and sorting in parallel computation
Optimal parallel merging and sorting without memory conflicts
Data parallel sorting for particle simulation
Journal Article
·
Sat Oct 01 00:00:00 EDT 1983
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5363554
Optimal parallel merging and sorting without memory conflicts
Journal Article
·
Sat Oct 31 23:00:00 EST 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5912451
Data parallel sorting for particle simulation
Journal Article
·
Fri May 01 00:00:00 EDT 1992
· Concurrency. Practice and Experience; (United Kingdom)
·
OSTI ID:6726397