Communication-efficient bitonic sort on a distributed memory parallel computer

Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Bitonic sorting can be parallelized, however, a great portion of execution time is consumed due to O(log/sup 2/P) time of data exchange of N/P keys where P, N are the number of processors and keys,...

Full description

Bibliographic Details

Published in:	Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001 pp. 165 - 170
Main Authors:	Yong Cheol Kim, Minsoo Jeon, Dongseung Kim, Sohn, A.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 2001
Subjects:	Application software Concurrent computing Costs Data communication Distributed computing Information science Load management Merging Partitioning algorithms Sorting
ISBN:	0769511538, 9780769511535
ISSN:	1521-9097
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!