We empirically analyze and compare two distributed, low-overhead policies for scheduling dynamic tree-structured computations on rings of identical PEs. Our experiments show that both policies give significant parallel speedup on large classes of computations, and that one yields almost optimal speedup on moderate size rings. We believe that our methodology of experiment design and analysis will prove useful in other such studies.
|Original language||English (US)|
|Number of pages||4|
|Journal||IEEE Symposium on Parallel and Distributed Processing - Proceedings|
|State||Published - Dec 1 1996|
|Event||Proceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing - New Orleans, LA, USA|
Duration: Oct 23 1996 → Oct 26 1996
ASJC Scopus subject areas