Efficient in-place sorting algorithms using feasible parallel machine models

We present a simple and general parallel sorting scheme, ZZ-sort, which can be used to derive a class of efficient in-place sorting algorithms on realistic parallel machine models. We prove a tight bound for the worst case performance of ZZ-sort. We also demonstrate the average performance of ZZ-sor...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96) s. 15 - 21
Hlavní autoři: Zheng, S.Q., Calidas, B., Yanjung Zhang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1996
Témata:
Application software
Computer science
Concurrent computing
Data communication
Memory management
Parallel machines
Parallel processing
Power engineering and energy
Power engineering computing
Sorting
ISBN:0818674601, 9780818674600
ISSN:1087-4089
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We present a simple and general parallel sorting scheme, ZZ-sort, which can be used to derive a class of efficient in-place sorting algorithms on realistic parallel machine models. We prove a tight bound for the worst case performance of ZZ-sort. We also demonstrate the average performance of ZZ-sort by experimental results obtained on a MasPar parallel computer. Our experiments indicate that ZZ-sort can be incorporated into a distributed memory parallel computer system as a standard routine, and this routine is useful for space critical situations. Finally, we show that ZZ-sort can be used to convert a non-adaptive parallel sorting algorithm into an in-place and adaptive one by considering the problem of sorting an arbitrarily large input on fixed-size reconfigurable meshes.
ISBN:0818674601
9780818674600
ISSN:1087-4089
DOI:10.1109/ISPAN.1996.508955