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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers) Ročník 2; s. 219 - 222 vol.2
Hlavní autoři: Armando, D.G., Marcelo, N., Franco, C., Laura, D.G.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2005
Témata:
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
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í: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 a balance in the work to be done by processors. Notice that the work does not depend only on the amount of data but also on the sequence disordering, and on the relative computer power of processors. This paper develops a technique of redistributing dynamically the data load from the prediction of work to be carried out by each processor, balancing the load among the different processes. The method is proved to reach the theoretical optimum for the parallel algorithm performance.
ISBN:9780769522494
0769522491
ISSN:1550-445X
DOI:10.1109/AINA.2005.168