skip to main content
research-article

An Improved Competitive Algorithm for Reordering Buffer Management

Published: 23 June 2015 Publication History

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.

References

[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.
[2]
Anna Adamaszek, Artur Czumaj, Matthias Englert, and Harald Räcke. 2011. Almost tight bounds for reordering buffer management. In STOC. 607--616.
[3]
Anna Adamaszek, Artur Czumaj, Matthias Englert, and Harald Räcke. 2012. Optimal online buffer scheduling for block devices. In STOC. 589--598.
[4]
Susanne Albers. 2010. New results on web caching with request reordering. Algorithmica 58, 2, 461--477.
[5]
Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, and Stephen Wagner. 2001. The k-client problem. Journal of Algorithms 41, 2, 115--173.
[6]
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, and Joseph Naor. 2009. The online set cover problem. SIAM Journal on Computing 39, 2, 361--370.
[7]
Noa Avigdor-Elgrabli, Sungjin Im, Benjamin Moseley, and Yuval Rabani. 2015. On the randomized competitive ratio of reordering buffer management with non-uniform costs. In ICALP (in press).
[8]
Noa Avigdor-Elgrabli and Yuval Rabani. 2013a. A constant factor approximation algorithm for reordering buffer management. In SODA.
[9]
Noa Avigdor-Elgrabli and Yuval Rabani. 2013b. An improved competitive algorithm for reordering buffer management. In FOCS. 1--10.
[10]
Reuven Bar-Yehuda and Jonathan Laserson. 2007. Exploiting locality: Approximating sorting buffers. Journal of Discrete Algorithms 5, 4, 729--738.
[11]
Yair Bartal. 1998. On approximating arbitrary metrices by tree metrics. In Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, Jeffrey Scott Vitter (Ed.). ACM, 161--168.
[12]
Dan Blandford and Guy Blelloch. 2002. Index compression through document reordering. In Proceedings of the Data Compression Conference (DCC’02). IEEE Computer Society, Washington, DC, 342. http://dl.acm.org/citation.cfm?id=882455.875020
[13]
Niv Buchbinder and Joseph Naor. 2005. Online primal-dual algorithms for covering and packing problems. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA’05) (Lecture Notes in Computer Science), Gerth Stølting Brodal and Stefano Leonardi (Eds.), Vol. 3669. Springer, 689--701.
[14]
Niv Buchbinder and Joseph Naor. 2009. The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science 3, 2--3, 93--263.
[15]
Ho-Leung Chan, Nicole Megow, René Sitters, and Rob van Stee. 2012. A note on sorting buffers offline. Theoretical Computer Science 423, 11--18.
[16]
Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, and Michael E. Saks. 2008. Online multicast with egalitarian cost sharing. In Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’08), Friedhelm Meyer auf der Heide and Nir Shavit (Eds.). ACM, 70--76.
[17]
Matthias Englert, Deniz Özmen, and Matthias Westermann. 2014. The power of reordering for online minimum makespan scheduling. SIAM Journal on Computing 43, 3, 1220--1237.
[18]
Matthias Englert, Harald Räcke, and Matthias Westermann. 2010. Reordering buffers for general metric spaces. Theory of Computing 6, 1, 27--46.
[19]
Matthias Englert and Matthias Westermann. 2005. Reordering buffer management for non-uniform cost models. In ICALP. 627--638.
[20]
Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, and Harald Räcke. 2014. Online stochastic reordering buffer scheduling. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP’14), Part I. 465--476.
[21]
Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. 2004. A tight bound on approximating arbitrary metrics by tree metrics. Journal of Computer and System Sciences 69, 3, 485--497.
[22]
Tomás Feder, Rajeev Motwani, Rina Panigrahy, and An Zhu. 2002. Web caching with request reordering. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, David Eppstein (Ed.). ACM/SIAM, 104--105.
[23]
Dimitris Fotakis. 2007. A primal-dual algorithm for online non-uniform facility location. Journal of Discrete Algorithms 5, 1, 141--148.
[24]
Iftah Gamzu and Danny Segev. 2009. Improved online algorithms for the sorting buffer problem on line metrics. ACM Transactions on Algorithms 6, 1.
[25]
K. Gutenschwager, S. Spiekermann, and S. Vos. 2004. A sequential ordering problem in automotive paint shops. International Journal of Production Research 42, 9, 1865--1878.
[26]
Sungjin Im and Benjamin Moseley. 2014. New approximations for reordering buffer management. In SODA. 1093--1111.
[27]
Rohit Khandekar and Vinayaka Pandit. 2006. Online sorting buffers on line. In STACS. 584--595.
[28]
Jens S. Kohrt and Kirk Pruhs. 2004. A constant approximation algorithm for sorting buffers. In LATIN. 193--202.
[29]
Jens Krokowski, Harald Räcke, Christian Sohler, and Matthias Westermann. 2004. Reducing state changes with a pipeline buffer. In VMV. 217.
[30]
Harald Räcke, Christian Sohler, and Matthias Westermann. 2002. Online scheduling for sorting buffers. In ESA. 820--832.
[31]
Abraham Silberschatz, Peter Galvin, and Greg Gagne. 2000. Applied Operating System Concepts, 1st ed. John Wiley, New York, NY.
[32]
V. V. Vazirani. 2001. Approximation Algorithms. Springer, New York, NY.

Cited By

View all
  • (2022)Almost Tight Bounds for Reordering Buffer ManagementSIAM Journal on Computing10.1137/20M132616751:3(701-722)Online publication date: 24-May-2022
  • (2020)Tight Bounds for Online Coloring of Basic Graph ClassesAlgorithmica10.1007/s00453-020-00759-783:1(337-360)Online publication date: 25-Aug-2020
  • (2019)Polylogarithmic Guarantees for Generalized Reordering Buffer Management2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2019.00012(38-59)Online publication date: Nov-2019
  • Show More Cited By

Index Terms

  1. An Improved Competitive Algorithm for Reordering Buffer Management

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Transactions on Algorithms
    ACM Transactions on Algorithms  Volume 11, Issue 4
    June 2015
    302 pages
    ISSN:1549-6325
    EISSN:1549-6333
    DOI:10.1145/2756876
    Issue’s Table of Contents
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 23 June 2015
    Accepted: 01 August 2014
    Received: 01 August 2013
    Published in TALG Volume 11, Issue 4

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Online computing
    2. reordering buffer management

    Qualifiers

    • Research-article
    • Research
    • Refereed

    Funding Sources

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)6
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 20 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Almost Tight Bounds for Reordering Buffer ManagementSIAM Journal on Computing10.1137/20M132616751:3(701-722)Online publication date: 24-May-2022
    • (2020)Tight Bounds for Online Coloring of Basic Graph ClassesAlgorithmica10.1007/s00453-020-00759-783:1(337-360)Online publication date: 25-Aug-2020
    • (2019)Polylogarithmic Guarantees for Generalized Reordering Buffer Management2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2019.00012(38-59)Online publication date: Nov-2019
    • (2019)Stochastic Dominance and the Bijective Ratio of Online AlgorithmsAlgorithmica10.1007/s00453-019-00638-wOnline publication date: 29-Oct-2019

    View Options

    Login options

    Full Access

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media