(C) Algorithms for Sorting Arbitrary Input Using a Fixed-Size Parallel Sorting Device

Authors:
Affiliations:
Venue:
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 2
Year:
1996

Citing 0
Cited 1

Time- and VLSI-Optimal Sorting on Enhanced Meshes

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: A simple computing model for sorting an arbitrary number of elements using a fixed-size sorting device is proposed, and a framework for designing a class of parallel sorting algorithms under this model is presented.