On-line scheduling mesh jobs with dependencies
From MaRDI portal
Publication:870843
DOI10.1016/j.tcs.2006.11.014zbMath1108.68024OpenAlexW2076983765MaRDI QIDQ870843
Publication date: 15 March 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.11.014
Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling multiprocessor tasks -- An overview
- Dynamic scheduling on parallel machines
- Optimal on-line scheduling of parallel jobs with dependencies
- Online algorithms: a survey
- Complexity of Scheduling Parallel Task Systems
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Scheduling Parallel Machines On-Line
- Mathematical Foundations of Computer Science 2003
- Bounds for Certain Multiprocessing Anomalies
- The Approximation of Numbers as Sums of Reciprocals
- On-line scheduling of parallel jobs with runtime restrictions
This page was built for publication: On-line scheduling mesh jobs with dependencies