Approximating the throughput of multiple machines under real-time scheduling
From MaRDI portal
Publication:2819592
DOI10.1145/301250.301420zbMath1345.68026OpenAlexW2062875287MaRDI QIDQ2819592
Sudipto Guha, Baruch Schieber, Amotz Bar-Noy, Joseph (Seffi) Naor
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301420
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (5)
Online real-time preemptive scheduling of jobs with deadlines on multiple machines ⋮ Approximation algorithms for maximum weight k-coverings of graphs by packings ⋮ The lazy bureaucrat scheduling problem ⋮ Maximum max-k-clique subgraphs in cactus subtree graphs ⋮ Aligning two fragmented sequences
This page was built for publication: Approximating the throughput of multiple machines under real-time scheduling
