An improved competitive algorithm for reordering buffer management

Authors:
Noa Avigdor-Elgrabli;Yuval Rabani
Affiliations:
Israel Institute of Technology, Haifa, Israel;The Hebrew University of Jerusalem, Jerusalem, Israel
Venue:
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Year:
2010

Citing 20
Cited 5

On approximating arbitrary metrices by tree metrics

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Applied operating system concepts

Applied operating system concepts
Approximation algorithms

Approximation algorithms
The k-client problem

Journal of Algorithms
Web caching with request reordering

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Online Scheduling for Sorting Buffers

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
The online set cover problem

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Index Compression through Document Reordering

DCC '02 Proceedings of the Data Compression Conference
New results on web caching with request reordering

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A tight bound on approximating arbitrary metrics by tree metrics

Journal of Computer and System Sciences - Special issue: STOC 2003
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
Online multicast with egalitarian cost sharing

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
The Power of Reordering for Online Minimum Makespan Scheduling

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Improved online algorithms for the sorting buffer problem

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Online sorting buffers on line

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
A primal-dual algorithm for online non-uniform facility location

PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
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
Offline sorting buffers on line

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Almost tight bounds for reordering buffer management

Proceedings of the forty-third annual ACM symposium on Theory of computing
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We design and analyze an on-line reordering buffer management algorithm with improved O (log k/log log k) competitive ratio for non-uniform costs, where k is the buffer size. This improves on the best previous result (even for uniform costs) of Englert and Westermann (ICALP 2005) giving O(log k) competitive ratio, which was also the best (off-line) polynomial time approximation guarantee for this problem. Our analysis is based on an intricate dual fitting argument using a linear programming relaxation for the problem that we introduce in this paper.