Online Scheduling for Sorting Buffers
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Index Compression through Document Reordering
DCC '02 Proceedings of the Data Compression Conference
Reordering buffers for general metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Online and offline algorithms for the sorting buffers problem on the line metric
Journal of Discrete Algorithms
Improved online algorithms for the sorting buffer problem
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An improved competitive algorithm for reordering buffer management
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Reordering buffer management for non-uniform cost models
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Exploiting locality: approximating sorting buffers
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
A note on sorting buffers offline
Theoretical Computer Science
NP-hardness of the sorting buffer problem on the uniform metric
Discrete Applied Mathematics
Optimal online buffer scheduling for block devices
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A bicriteria approximation for the reordering buffer problem
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
We give almost tight bounds for the online reordering buffer management problem on the uniform metric. Specifically, we present the first non-trivial lower bounds for this problem by showing that deterministic online algorithms have a competitive ratio of at least Ω(√{log k/log log k}) and randomized online algorithms have a competitive ratio of at least Ω(log log k), where k denotes the size of the buffer. We complement this by presenting a deterministic online algorithm for the reordering buffer management problem that obtains a competitive ratio of O(√log k), almost matching the lower bound. This improves upon an algorithm by Avigdor-Elgrabli and Rabani (SODA 2010) that achieves a competitive ratio of O(log k/ log log k).