Improvements in throughout maximization for real-time scheduling
From MaRDI portal
Publication:3192041
DOI10.1145/335305.335401zbMath1296.90040OpenAlexW2074557115MaRDI QIDQ3192041
Piotr Berman, Bhaskar Das Gupta
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335401
Related Items (10)
Online real-time preemptive scheduling of jobs with deadlines on multiple machines ⋮ Online Throughput Maximization on Unrelated Machines: Commitment is No Burden ⋮ Unnamed Item ⋮ Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization ⋮ Approximations for Throughput Maximization ⋮ Throughput scheduling with equal additive laxity ⋮ Throughput scheduling with equal additive laxity ⋮ Set cover problems with small neighborhood covers ⋮ Online deadline scheduling on faster machines. ⋮ Efficient job scheduling algorithms with multi-type contentions
This page was built for publication: Improvements in throughout maximization for real-time scheduling
