Optimal online buffer scheduling for block devices
From MaRDI portal
Publication:5415503
DOI10.1145/2213977.2214031zbMath1286.68026OpenAlexW1986948757WikidataQ58203681 ScholiaQ58203681MaRDI QIDQ5415503
Matthias Englert, Harald Räcke, Anna Adamaszek, Artur Czumaj
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2213977.2214031
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs ⋮ R-LINE: a better randomized 2-server algorithm on the line ⋮ Almost Tight Bounds for Reordering Buffer Management