An empirical study of dynamic scheduling on rings of processors

Author

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

Author_Institution

Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA

fYear

1996

fDate

23-26 Oct 1996

Firstpage

470

Lastpage

473

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

Keywords

parallel algorithms; parallel architectures; parallel machines; processor scheduling; trees (mathematics); virtual machines; distributed law-overhead policies; dynamic tree-structured computation scheduling; optimal speedup; parallel speedup; processor rings; Acceleration; Algorithm design and analysis; Clocks; Computer architecture; Computer science; Concurrent computing; Design methodology; Distributed computing; Dynamic scheduling; Processor scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1996., Eighth IEEE Symposium on

Conference_Location

New Orleans, LA

Print_ISBN

0-8186-7683-3

Type

conf

DOI

10.1109/SPDP.1996.570370

Filename

570370

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2376401