SCHEDULING FLAT GRAPHS.

Danny Dolev*, Manfred Warmuth

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

20 Scopus citations

Abstract

The problem of scheduling a partially ordered set of unit length tasks on m identical processors is known to be NP-complete. There are efficient algorithms for only a few special cases of this problem. The authors analyzed the effect of the structure of the precedence graph and the availability of the processors on the construction of optimal schedules. They proved that to find an optimal schedule it suffices to consider at each step only initial tasks which belong to the m - l highest components of the precedence graph. Their method leads to polynomial algorithms if the number of processors is fixed and the precedence graph has a certain form. In particular, if the precendence graph contains only intrees and outtrees, this result leads to linear algorithms for finding an optimal schedule on two or three processors.

Original languageEnglish
Pages (from-to)638-657
Number of pages20
JournalSIAM Journal on Computing
Volume14
Issue number3
DOIs
StatePublished - 1985

Fingerprint

Dive into the research topics of 'SCHEDULING FLAT GRAPHS.'. Together they form a unique fingerprint.

Cite this