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

S.Q. Zheng

doi:10.1109/ICPP.1996.537387

Previous
Next
Table of Contents

Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing

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

Year: 1996, Volume: 2, Pages: 0095

DOI Bookmark: 10.1109/ICPP.1996.537387

Authors

S.Q. Zheng, Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA

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.

Like what you’re reading?

Already a member?

Get this article FREE with a new membership!