Scheduling Tasks with Small Communication Delays for Clusters of Processors

E. Bampis (), R. Giroudeau and A. Kononov

Annals of Operations Research, 2004, vol. 129, issue 1, 47-63

Abstract: We adopt the hierarchical communications model of (Bampis, Giroudeau, and König, 2000) and we present an approximation algorithm for the precedence constrained multiprocessor scheduling problem in the presence of small hierarchical communication delays (Chrétienne and Colin, 1991). Our algorithm is based on linear programming and rounding and has a performance guarantee of 12(Φ+1)/(12Φ+1) where Φ≥1 is the ratio of the smallest processing time of the tasks and of the maximum intercluster communication delay. This result generalizes the result of (Bampis, Giroudeau, and König, 2000) for the problem with unit execution times and unit intercluster communication delays. Copyright Kluwer Academic Publishers 2004

Keywords: scheduling; communication delays; approximation algorithms (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/B:ANOR.0000030681.44697.7f (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:129:y:2004:i:1:p:47-63:10.1023/b:anor.0000030681.44697.7f

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/B:ANOR.0000030681.44697.7f

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().