Dynamic load balance in parallel merge sorting over homogeneous clusters

Sorting is one of the most usual and important operations carried out in a computer. The time required by the sequential sorting algorithms is an important problem when working with large sized sequences. As solution, we can consider parallelization and attaining a near optimal performance achieving...

Full description

Bibliographic Details

Published in:	19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers) Vol. 2; pp. 219 - 222 vol.2
Main Authors:	Armando, D.G., Marcelo, N., Franco, C., Laura, D.G.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 2005
Subjects:	Algorithm Parallelization Computer architecture Computer science Concurrent computing Dynamic Redistribution Hardware Load Balancing Load management Parallel algorithms Parallel processing Performance Prediction Prediction algorithms Sorting
ISBN:	9780769522494, 0769522491
ISSN:	1550-445X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!