Scheduling tasks with small communication delays for clusters of processors

DOI10.1023/B:ANOR.0000030681.44697.7FMaRDI QIDQ596450zbMATH OpenFDO

Authors Evripidis Bampis, Rodolphe Giroudeau, Alexander Kononov

Publication date 10 August 2004

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:ANOR.0000030681.44697.7F

zbMATH Keywords

approximation algorithmscommunication delaysscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
• An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
• Scheduling tasks with communication delays on parallel processors
• Complexity and approximation for precedence constrained scheduling problems with large communication delays
• scientific article; zbMATH DE number 1500535

Cited in

(5)

• An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
• An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
• Scheduling with duplication on m processors with small communication delays
• scientific article; zbMATH DE number 1500535 (Why is no real title available?)
• An approximation algorithm for scheduling dependent tasks on m processors with small communication delays

This page was built for publication: Scheduling tasks with small communication delays for clusters of processors

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