The Complexity of Scheduling Trees with Communication Delays
From MaRDI portal
Publication:4864438
DOI10.1006/jagm.1996.0007zbMath0840.68013OpenAlexW2148654963MaRDI QIDQ4864438
Marinus Veldhorst, Jan Karel Lenstra, Bart Veltman
Publication date: 20 February 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1996.0007
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (12)
Three, four, five, six, or the complexity of scheduling with communication delays ⋮ Parallel Machine Scheduling with Uncertain Communication Delays ⋮ Performance of Coffman-Graham schedules in the presence of unit communication delays ⋮ Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays ⋮ Scheduling trees with large communication delays on two identical processors ⋮ An EPTAS for scheduling fork-join graphs with communication delay ⋮ Scheduling UET-UCT outforests to minimize maximum lateness ⋮ Performance of critical path type algorithms for scheduling on parallel processors ⋮ Scheduling unitary task systems with zero--one communication delays for quasi-interval orders ⋮ Scheduling inverse trees under the communication model of the LogP-machine ⋮ Scheduling 2-dimensional grids with large communication delays ⋮ Unconstrained static scheduling with communication weights
This page was built for publication: The Complexity of Scheduling Trees with Communication Delays
