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
A Primal-Dual Randomized Algorithm for Weighted Paging
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Evaluation of online strategies for reordering buffers
Journal of Experimental Algorithmics (JEA)
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
Almost tight bounds for reordering buffer management
Proceedings of the forty-third annual ACM symposium on Theory of computing
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
An O(log k)-competitive algorithm for generalized caching
Proceedings of the twenty-third 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
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Exploiting locality: approximating sorting buffers
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
We introduce a buffer scheduling problem for block operation devices in an online setting. We consider a stream of items of different types to be processed by a block device. The block device can process all items of the same type in a single step. To improve the performance of the system a buffer of size k is used to store items in order to reduce the number of operations required. Whenever the buffer becomes full a buffer scheduling strategy has to select one type and then a block operation on all elements with this type that are currently in the buffer is performed. The goal is to design a scheduling strategy that minimizes the number of block operations required. In this paper we consider the online version of this problem, where the buffer scheduling strategy must make decisions without knowing the future items that appear in the input stream. Our main result is the design of an O(log log k)-competitive online randomized buffer scheduling strategy. The bound is asymptotically tight. As a byproduct of our LP-based techniques, we obtain a randomized offline algorithm that approximates the optimal number of block operations to within a constant factor.