Scheduling 2-dimensional grids with large communication delays

DOI10.1051/ro/2014048zbMath1310.90044OpenAlexW1969437280MaRDI QIDQ5247700

Frédéric Wagner, El Mostafa Daoudi, Denis Trystram

Publication date: 27 April 2015

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

Full work available at URL: https://doi.org/10.1051/ro/2014048

zbMATH Keywords

schedulingparallel processinglarge communication delays

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity and approximation for precedence constrained scheduling problems with large communication delays
• Scheduling for parallel processing
• UET scheduling with unit interprocessor communication delays
• Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems
• List scheduling with and without communication delays
• Scheduling trees with large communication delays on two identical processors
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• The Complexity of Scheduling Trees with Communication Delays
• Some models for scheduling parallel programs with communication delays

This page was built for publication: Scheduling 2-dimensional grids with large communication delays