Scheduling Precedence Task Graphs with Disturbances

DOI10.1051/RO:2003018MaRDI QIDQ4467894zbMATH OpenOpenAlexFDO

Authors Apurv Gupta, Gilles Parmentier, Denis Trystram

Publication date 10 June 2004

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=RO_2003__37_3_145_0, https://eudml.org/doc/105286

zbMATH Keywords

parallel processingcommunication delayscommunication times

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2090582
• Parallel Machine Scheduling with Uncertain Communication Delays
• Online Scheduling of Precedence Constrained Tasks
• Scheduling loosely connected task graphs.
• Optimal parallel processing of random task graphs

Cites work

• scientific article; zbMATH DE number 108110 (Why is no real title available?)
• scientific article; zbMATH DE number 934540 (Why is no real title available?)
• Parallel Machine Scheduling with Uncertain Communication Delays
• REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE
• Robust discrete optimization and its applications
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• Towards an Architecture-Independent Analysis of Parallel Algorithms

Cited in

(4)

• Scheduling with uncertainties on new computing platforms
• Sensitivity bounds for machine scheduling with uncertain communication delays
• scientific article; zbMATH DE number 2090582 (Why is no real title available?)
• Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming

This page was built for publication: Scheduling Precedence Task Graphs with Disturbances

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