Journal of Algorithms
A comparative analysis of disk scheduling policies
Communications of the ACM
Online Scheduling for Sorting Buffers
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
New results on web caching with request reordering
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Combining request scheduling with web caching
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
ACM SIGACT News
Reordering buffers for general metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Exploiting locality: approximating sorting buffers
Journal of Discrete Algorithms
Evaluation of online strategies for reordering buffers
Journal of Experimental Algorithmics (JEA)
Buffer management for colored packets with deadlines
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Improved online algorithms for the sorting buffer problem on line metrics
ACM Transactions on Algorithms (TALG)
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
Evaluation of online strategies for reordering buffers
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Online sorting buffers on line
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
A note on sorting buffers offline
Theoretical Computer Science
Offline sorting buffers on line
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
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 |
A sequence of objects which are characterized by their color has to be processed. Their processing order influences how efficiently they can be processed: Each color change between two consecutive objects produces non-uniform cost. A reordering buffer which is a random access buffer with storage capacity for k objects can be used to rearrange this sequence in such a way that the total cost are minimized. This concept is useful for many applications in computer science and economics. We show that a reordering buffer reduces the cost of each sequence by a factor of at most 2k–1. This result even holds for cost functions modeled by arbitrary metric spaces. In addition, a matching lower bound is presented. From this bound follows that each strategy that does not increase the cost of a sequence is at least (2k–1)-competitive. As main result, we present the deterministic Maximum Adjusted Penalty (MAP) strategy which is O(log k)-competitive. Previous strategies only achieve a competitive ratio of k in the non-uniform model. For the upper bound on MAP, we introduce a basic proof technique. We believe that this technique can be interesting for other problems.