Sorting and merging on the DAP

Authors:
D. Bhagavathi;W. M. Denny;C. Grosch;P. J. Looges;S. Olariu
Affiliations:
Old Dominion University, Norfolk, Va.;Old Dominion University, Norfolk, Va.;Old Dominion University, Norfolk, Va.;Old Dominion University, Norfolk, Va.;Old Dominion University, Norfolk, Va.
Venue:
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Year:
1992

Citing 8
Cited 0

The design and analysis of parallel algorithms

The design and analysis of parallel algorithms
Constant time sorting on a processor array with a reconfigurable bus system

Information Processing Letters
Massively parallel computing with the DAP

Massively parallel computing with the DAP
Optimal VLSI Sorting with Reduced Number of Processors

IEEE Transactions on Computers
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Parallel Sorting Algorithms

Parallel Sorting Algorithms
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing
Data Structures and Algorithms

Data Structures and Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The sorting problem is of fundamental importance in non-numerical algorithms. Many applications require the ordering of data based the relationship of some set of keys with in the data. Merging is a natural companion of sorting, and is known to yield a very efficient sorting algorithm in sequential processing. Numerous sorting and merging techniques have been developed for many actual and theoretical models, we examine a number of these techniques for implementation on the Distributed Array of Processors, DAP.