Empirical study of dynamic scheduling on rings of processors

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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)
Title of host publicationIEEE Symposium on Parallel and Distributed Processing - Proceedings
Editors Anon
PublisherIEEE
Pages470-473
Number of pages4
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing - New Orleans, LA, USA
Duration: Oct 23 1996Oct 26 1996

Other

OtherProceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing
CityNew Orleans, LA, USA
Period10/23/9610/26/96

Fingerprint

Scheduling
Design of experiments
Experiments

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Gregory, D. E., Gao, L., Rosenberg, A. L., & Cohen, P. R. (1996). Empirical study of dynamic scheduling on rings of processors. In Anon (Ed.), IEEE Symposium on Parallel and Distributed Processing - Proceedings (pp. 470-473). IEEE.

Empirical study of dynamic scheduling on rings of processors. / Gregory, Dawn E.; Gao, Lixin; Rosenberg, Arnold L.; Cohen, Paul R.

IEEE Symposium on Parallel and Distributed Processing - Proceedings. ed. / Anon. IEEE, 1996. p. 470-473.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gregory, DE, Gao, L, Rosenberg, AL & Cohen, PR 1996, Empirical study of dynamic scheduling on rings of processors. in Anon (ed.), IEEE Symposium on Parallel and Distributed Processing - Proceedings. IEEE, pp. 470-473, Proceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing, New Orleans, LA, USA, 10/23/96.
Gregory DE, Gao L, Rosenberg AL, Cohen PR. Empirical study of dynamic scheduling on rings of processors. In Anon, editor, IEEE Symposium on Parallel and Distributed Processing - Proceedings. IEEE. 1996. p. 470-473
Gregory, Dawn E. ; Gao, Lixin ; Rosenberg, Arnold L. ; Cohen, Paul R. / Empirical study of dynamic scheduling on rings of processors. IEEE Symposium on Parallel and Distributed Processing - Proceedings. editor / Anon. IEEE, 1996. pp. 470-473
@inproceedings{be25d589175c4ca6b4751ac7643dd220,
title = "Empirical study of dynamic scheduling on rings of processors",
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.",
author = "Gregory, {Dawn E.} and Lixin Gao and Rosenberg, {Arnold L.} and Cohen, {Paul R}",
year = "1996",
language = "English (US)",
pages = "470--473",
editor = "Anon",
booktitle = "IEEE Symposium on Parallel and Distributed Processing - Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Empirical study of dynamic scheduling on rings of processors

AU - Gregory, Dawn E.

AU - Gao, Lixin

AU - Rosenberg, Arnold L.

AU - Cohen, Paul R

PY - 1996

Y1 - 1996

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

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

UR - http://www.scopus.com/inward/record.url?scp=0030420045&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030420045&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030420045

SP - 470

EP - 473

BT - IEEE Symposium on Parallel and Distributed Processing - Proceedings

A2 - Anon, null

PB - IEEE

ER -