Short Communication: Asynchronous parallel merging

Authors:
M. Wheat;D. J. Evans
Affiliations:
-;-
Venue:
Parallel Computing
Year:
1991

Citing 3
Cited 0

The parallel neighbour sort and 2-way merge algorithm (Short Communication)

Parallel Computing
Implementing Quicksort programs

Communications of the ACM
Short Communication: Maintenance of shared data structures on tightly coupled multiprocessors

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An asynchronous scheduling strategy for use in conjunction with any sequential merging algorithm to implement an asynchronous parallel merging algorithm on an MIMD multiprocessor is presented. In particular, an asynchronous parallel implementation of the 2-way merge algorithm is described and used as a component in three versions of a parallel sorting algorithm. Their performance is compared when executed on the Sequent Balance 8000 multiprocessor.