A linear time algorithm for scheduling outforests with communication delays on three processors

DOI10.1016/S0196-6774(02)00201-8zbMATH Open1032.68024DBLPjournals/jal/DellAmicoF02OpenAlexW1984180721WikidataQ59222291 ScholiaQ59222291MaRDI QIDQ4805397FDOQ4805397

Authors: Mauro Dell'Amico, Lucian Finta 

Publication date: 14 May 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00201-8

Recommendations

• The Complexity of Scheduling Trees with Communication Delays
• Scheduling tasks with communication delays on parallel processors
• Scheduling series--parallel orders subject to 0/1-communication delays
• Three, four, five, six, or the complexity of scheduling with communication delays
• scientific article; zbMATH DE number 3900151

zbMATH Keywords

dynamic programming algorithmparallel processors

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (1)

• Tight performance bounds of CP-scheduling on out-trees

This page was built for publication: A linear time algorithm for scheduling outforests with communication delays on three processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4805397)