scientific article; zbMATH DE number 2086382

MaRDI QIDQ4736836zbMATH OpenFDO

Authors Renaud Lepère, Christophe Rapine

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850154.htm

zbMATH Keywords

approximation algorithmcommunication timesduplicationmakespanperformance guaranteescheduling

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

• Scheduling with duplication on m processors with small communication delays
• Task scheduling with and without communication delays: A unified approach
• Complexity and approximation for precedence constrained scheduling problems with large communication delays
• Scheduling in the presence of processor networks : complexity and approximation
• Scheduling jobs with communication delays: using infeasible solutions for approximation

Cited in

(5)

• Using duplication for scheduling unitary tasks on m processors with unit communication delays
• Minimizing the volume in scheduling an out-tree with communication delays and duplication.
• Scheduling with duplication on m processors with small communication delays
• On the advantage of overlapping clusters for minimizing conductance
• Scheduling 2-dimensional grids with large communication delays

This page was built for publication:

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