Empirical study of dynamic scheduling on rings of processors

Dawn E. Gregory, Lixin Gao, Arnold L. Rosenberg, Paul R. Cohen

Research output: Contribution to journalConference article

Abstract

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 languageEnglish (US)
Pages (from-to)470-473
Number of pages4
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
StatePublished - Dec 1 1996
EventProceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing - New Orleans, LA, USA
Duration: Oct 23 1996Oct 26 1996

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this