Scheduling trees with large communication delays on two identical processors

DOI10.1007/s10951-005-6366-3zbMath1154.90398OpenAlexW2078418199MaRDI QIDQ2464442

Evripidis Bampis, Foto N. Afrati, Ioannis Milis, Lucian Finta

Publication date: 20 December 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-005-6366-3

zbMATH Keywords

schedulingmakespantreescommunication delaystwo processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays ⋮ Scheduling 2-dimensional grids with large communication delays

Cites Work

• Unnamed Item
• Unnamed Item
• Multiprocessor scheduling with communication delays
• UET scheduling with unit interprocessor communication delays
• Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
• On the complexity of scheduling with large communication delays
• Scheduling UET-UCT series-parallel graphs on two processors
• Optimal scheduling for two-processor systems
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Complexity of Scheduling Trees with Communication Delays
• Optimal Sequencing of Two Equivalent Processors

This page was built for publication: Scheduling trees with large communication delays on two identical processors