An Empirical Study of Dynamic Scheduling on Rings of Processors

Authors

Dawn E. Gregory, University of Massachusetts Amherst
Lixin Gao, University of Massachusetts Amherst
Arnold L. Rosenberg, University of Massachusetts Amherst
Paul R. Cohen, University of Massachusetts Amherst

Publication Date

1996

Journal or Book Title

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing

Abstract

The authors empirically analyze and compare two distributed low-overhead policies for scheduling dynamic tree-structured computations on rings of identical PEs. The 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. They believe that the methodology of experiment design and analysis will prove useful in other such studies.

DOI

https://doi.org/10.1109/SPDP.1996.570370

Recommended Citation

Gregory, Dawn E.; Gao, Lixin; Rosenberg, Arnold L.; and Cohen, Paul R., "An Empirical Study of Dynamic Scheduling on Rings of Processors" (1996). Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing. 1365.
https://doi.org/10.1109/SPDP.1996.570370