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...

Full description

Bibliographic Details

Published in:	Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96) pp. 15 - 21
Main Authors:	Zheng, S.Q., Calidas, B., Yanjung Zhang
Format:	Conference Proceeding
Language:	English
Published:	IEEE 1996
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!