DocumentCode :
2035299
Title :
SnakeSort: A Family of Simple Optimal Randomized Sorting Algorithms
Author :
Blackston, David T. ; Ranade, Abhiram
Author_Institution :
University of California at Berkeley, USA
Volume :
3
fYear :
1993
fDate :
16-20 Aug. 1993
Firstpage :
201
Lastpage :
204
Abstract :
We present a family of exceedingly simple sorting algorithms called Snakesort. Snakesort is a natural generalization of the simple barallel bubble sort algorithm, also known as odd-even transposition sort. Instances of Snakesort can be implemented on any interconnection network so long as it has a Hamiltonian Path.
Keywords :
Hypercubes; Multiprocessor interconnection networks; Parallel processing; Radio access networks; Sorting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing, 1993. ICPP 1993. International Conference on
Conference_Location :
Syracuse, NY, USA
ISSN :
0190-3918
Print_ISBN :
0-8493-8983-6
Type :
conf
DOI :
10.1109/ICPP.1993.164
Filename :
4134269
Link To Document :
بازگشت