Minimizing the schedule length for a parallel 3D-grid precedence graph

DOI10.1016/0377-2217(95)00297-9zbMath0947.90575OpenAlexW2080512320MaRDI QIDQ1278401

Evripidis Bampis, Denis Trystram, Jean-Claude Konig

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00297-9

zbMATH Keywords

schedulinggridprecedence graphcommunicationsoverhead

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Some models for scheduling parallel programs with communication delays

Cites Work

• A state-of-the-art review of parallel-machine scheduling research
• Parallel Gaussian elimination on an MIMD computer
• Optimal scheduling algorithms for parallel Gaussian elimination
• Impact of communications of the complexity of the parallel Gaussian elimination
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• A Communication-Time Tradeoff
• Solving Linear Algebraic Equations on an MIMD Computer
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing the schedule length for a parallel 3D-grid precedence graph