Optimal online scheduling of parallel jobs with dependencies
From MaRDI portal
Publication:5248535
DOI10.1145/167088.167254zbMath1310.68251OpenAlexW2054042656MaRDI QIDQ5248535
Anja Feldmann, Jiří Sgall, Ming-Yang Kao, Shang-Hua Teng
Publication date: 7 May 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/167088.167254
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items
Dynamic scheduling on parallel machines ⋮ Scheduling resource allocation with timeslot penalty for changeover ⋮ On-line scheduling of parallel jobs ⋮ Scheduling parallel tasks with individual deadlines ⋮ An approximation algorithm for scheduling trees of malleable tasks ⋮ Scheduling space-sharing for internet advertising ⋮ A note on on-line scheduling with precedence constraints on identical machines