Scheduling complete intrees on two uniform processors with communication delays

DOI10.1016/0020-0190(96)00062-2zbMath0875.68509OpenAlexW2052698313WikidataQ57387867 ScholiaQ57387867MaRDI QIDQ1349970

Denis Trystram, Pascal Bouvry, Jacek Błażewicz, Frédéric Guinand

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/152

zbMATH Keywords

Parallel algorithmsSchedulingParallelismIntreesUniform processors

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
• Multiprocessor scheduling with communication delays
• The complexity of facets (and some facets of complexity)
• The complexity of scheduling problems with communication delays for trees

This page was built for publication: Scheduling complete intrees on two uniform processors with communication delays