Approximation algorithms for scheduling with a limited number of communications

DOI10.1016/S0167-8191(00)00032-6MaRDI QIDQ1575597zbMATH OpenOpenAlexFDO

Authors Chams Lahlou

Publication date 21 August 2000

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(00)00032-6

zbMATH Keywords

worst-case analysisprecedence constraintsmultiprocessor schedulingcommunication contentionbus machine

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1061006
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
• Bicriteria approximation algorithms for scheduling problems with communications delays
• New complexity results on scheduling with small communication delays
• Complexity and approximation for precedence constrained scheduling problems with large communication delays
• scientific article; zbMATH DE number 2090583
• An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
• scientific article; zbMATH DE number 1500535
• Scheduling jobs with communication delays: using infeasible solutions for approximation

Cited in

(1)

• Scheduling on Two Unbounded Resources with Communication Costs

This page was built for publication: Approximation algorithms for scheduling with a limited number of communications

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