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

Podrobná bibliografia

Vydané 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í autori:	Armando, D.G., Marcelo, N., Franco, C., Laura, D.G.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 2005
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!