Scheduling in the dark
From MaRDI portal
Publication:5890866
DOI10.1145/301250.301299zbMath1345.68028OpenAlexW2144287101MaRDI QIDQ5890866
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.301299
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (11)
On-line scheduling with tight deadlines. ⋮ Non-clairvoyant scheduling games ⋮ Improved results for scheduling batched parallel jobs by using a generalized analysis framework ⋮ On the competitiveness of AIMD-TCP within a general network ⋮ Resource augmented semi-online bounded space bin packing ⋮ TCP is competitive with resource augmentation ⋮ A tighter extra-resource analysis of online deadline scheduling ⋮ New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling ⋮ Non-Clairvoyant Precedence Constrained Scheduling. ⋮ Resource augmentation in load balancing. ⋮ Applying extra-resource analysis to load balancing.
This page was built for publication: Scheduling in the dark
