An Improved Competitive Algorithm for Reordering Buffer Management-Reference-Cited by-同舟云学术

An Improved Competitive Algorithm for Reordering Buffer Management

Published:2015-06-23 Issue:4 Volume:11 Page:1-15
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Avigdor-Elgrabli Noa¹,Rabani Yuval²

Affiliation:

1. Yahoo! Labs, Haifa, Israel

2. The Hebrew University of Jerusalem, Jerusalem, Israel

Abstract

We design and analyze an online reordering buffer management algorithm with improved O (log k /log log k ) competitive ratio for nonuniform costs, where k is the buffer size. This improves on the best previous result (even for uniform costs) of Englert and Westermann (2005) giving O (log k ) competitive ratio, which was also the best (offline) 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 article.

Funder

Israel Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/2663347

Reference32 articles.

1. Amjad Aboud. 2008. Correlation clustering with penalties and approximating the reordering buffer management problem. Masters thesis Computer Science Department The Technion — Israel Institute of Technology. Amjad Aboud. 2008. Correlation clustering with penalties and approximating the reordering buffer management problem. Masters thesis Computer Science Department The Technion — Israel Institute of Technology.

2. Anna Adamaszek Artur Czumaj Matthias Englert and Harald Räcke. 2011. Almost tight bounds for reordering buffer management. In STOC. 607--616. 10.1145/1993636.1993717 Anna Adamaszek Artur Czumaj Matthias Englert and Harald Räcke. 2011. Almost tight bounds for reordering buffer management. In STOC. 607--616. 10.1145/1993636.1993717

3. Anna Adamaszek Artur Czumaj Matthias Englert and Harald Räcke. 2012. Optimal online buffer scheduling for block devices. In STOC. 589--598. 10.1145/2213977.2214031 Anna Adamaszek Artur Czumaj Matthias Englert and Harald Räcke. 2012. Optimal online buffer scheduling for block devices. In STOC. 589--598. 10.1145/2213977.2214031

4. New Results on Web Caching with Request Reordering

5. The k-Client Problem

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Almost Tight Bounds for Reordering Buffer Management;SIAM Journal on Computing;2022-05-24

2. Tight Bounds for Online Coloring of Basic Graph Classes;Algorithmica;2020-08-25

3. Polylogarithmic Guarantees for Generalized Reordering Buffer Management;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11

4. Stochastic Dominance and the Bijective Ratio of Online Algorithms;Algorithmica;2019-10-29