Title :
Algorithms for sorting arbitrary input using a fixed-size parallel sorting device
Author_Institution :
Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA
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
Keywords :
computational complexity; parallel algorithms; sorting; arbitrary input sorting algorithms; computing model; fixed-size parallel sorting device; parallel sorting algorithms; Algorithm design and analysis; Circuits; Computer networks; Computer science; Concurrent computing; Coprocessors; Costs; Joining processes; Sorting; Very large scale integration;
Conference_Titel :
Parallel Processing, 1996. Vol.3. Software., Proceedings of the 1996 International Conference on
Conference_Location :
Ithaca, NY
Print_ISBN :
0-8186-7623-X
DOI :
10.1109/ICPP.1996.537387
