Elsevier

Theoretical Computer Science

Volume 707, 10 January 2018, Pages 89-93
Theoretical Computer Science

Note
Logarithmic price of buffer downscaling on line metrics

https://doi.org/10.1016/j.tcs.2017.10.008Get rights and content
Under an Elsevier user license
open archive

Abstract

We consider the reordering buffer problem on a line consisting of n equidistant points. We show that, for any constant δ, an (offline) algorithm that has a buffer (1δ)k performs worse by a factor of Ω(logn) than an offline algorithm with buffer k. In particular, this demonstrates that the O(logn)-competitive online algorithm MovingPartition by Gamzu and Segev (2009) [9] is essentially optimal against any offline algorithm with a slightly larger buffer.

Keywords

Reordering buffer
Competitive analysis

Cited by (0)