Designing efficient algorithms for parallel computers | Guide books skip to main content ACM
Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign …

A new parallel sorting algorithm suitable for MIMD multiprocessor is presented. The
algorithm reduces memory and bus contention, which many parallel sorting algorithms suffer …

We consider the problem of external sorting in a shared-nothing multiprocessor. A critical
step in the algorithms we consider is to determine the range of sort keys to be handled by …

Parallel sorting algorithms have already been proposed for a variety of multiple instruction
streams, multiple data streams (MIMD) architectures. These algorithms often exploit the …

A parallelization of the Quicksort algorithm that is suitable for execution on a shared memory
multiprocessor with an efficient implementation of the fetch-and-add operation is presented …

External mergesort is normally implemented so that each run is stored continuously on disk
and blocks of data are read exactly in the order they are needed during merging. We …

An efficient multiprocessor algorithm to merge m, m⩾ 2, sorted lists containing N elements is
described. In a hierarchical-memory multiprocessor, the proposed method substantially …

A parallel sorting technique for external and internal sorting which maximizes the use of
multiple processes to sort records from an input data set. Performance of the sort linearly …

In concurrent computing environments based on heterogeneous processing elements
interconnected by general‐purpose networks, several classes of overheads contribute to …

QuickSort is a favoured sequential internal sorting algorithm due to its fast average running
time and its small memory requirements. Previous investigations into its parallel execution …