Algorithms for hierarchical and semi-partitioned parallel scheduling
From MaRDI portal
Publication:2037194
DOI10.1016/j.jcss.2021.03.006zbMath1479.90079OpenAlexW2725268594MaRDI QIDQ2037194
Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela
Publication date: 30 June 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-03498319/file/affinity-ipdps.pdf
makespan minimizationunrelated machineslaminar familyprocessor affinitiesclustered schedulingwrap-around rule
Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
- Assigning sporadic tasks to unrelated machines
- Improved approximation algorithms for scheduling parallel jobs on identical clusters
- Approximation algorithms for scheduling unrelated parallel machines
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Global wire routing in two-dimensional arrays
- An approximation algorithm for the generalized assignment problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Structural parameters for scheduling with assignment restrictions
- Parallel machine scheduling with nested job assignment restrictions
- Scheduling with Deadlines and Loss Functions
- Survey of scheduling techniques for addressing shared resources in multicore processors
- Iterative Methods in Combinatorial Optimization
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding
- Parallel machine scheduling with job assignment restrictions
- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
This page was built for publication: Algorithms for hierarchical and semi-partitioned parallel scheduling
