Skip to main content
SpringerLink
Log in

Scheduling with a Reordering Buffer

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Aboud A (2008) Correlation clustering with penalties and approximating the reordering buffer management problem. Master’s thesis, Computer Science Department, The Technion—Israel Institute of Technology

    Google Scholar 

  2. Adamaszek A, Czumaj A, Englert M, Räcke H (2011) Almost tight bounds for reordering buffer management. In: Proceedings of the 43rd ACM symposium on theory of computing (STOC), San Jose, pp 607–616

    Google Scholar 

  3. Adamaszek A, Czumaj A, Englert M, Räcke H (2012) Optimal online buffer scheduling for block devices. In: Proceedings of the 44th ACM symposium on theory of computing (STOC), New York, pp 589–598

    Google Scholar 

  4. Albers S, Hellwig M (2012) On the value of job migration in online makespan minimization. In: Proceedings of the 20th European symposium on algorithms (ESA), Ljubljana, pp 84–95

    Google Scholar 

  5. Asahiro Y, Kawahara K, Miyano E (2012) NP-hardness of the sorting buffer problem on the uniform metric. Discret Appl Math 160(10–11):1453–1464

    Article  MathSciNet  MATH  Google Scholar 

  6. Avigdor-Elgrabli N, Rabani Y (2010) An improved competitive algorithm for reordering buffer management. In: Proceedings of the 21st ACM-SIAM symposium on discrete algorithms (SODA), Austin, pp 13–21

    Google Scholar 

  7. Avigdor-Elgrabli N, Rabani Y (2013) A constant factor approximation algorithm for reordering buffer management. In: Proceedings of the 24th ACM-SIAM symposium on discrete algorithms (SODA), New Orleans, pp 973–984

    Google Scholar 

  8. Avigdor-Elgrabli N, Rabani Y (2013) An optimal randomized online algorithm for reordering buffer management. In: Proceedings of the 54th IEEE symposium on foundations of computer science (FOCS), Berkeley, pp 1–10

    Google Scholar 

  9. Bar-Yehuda R, Laserson J (2007) Exploiting locality: approximating sorting buffers. J Discret Algorithms 5(4):729–738

    Article  MathSciNet  MATH  Google Scholar 

  10. Barman S, Chawla S, Umboh S (2012) A bicriteria approximation for the reordering buffer problem. In: Proceedings of the 20th European symposium on algorithms (ESA), Ljubljana, pp 157–168

    Google Scholar 

  11. Buchbinder N, Naor J (2009) The design of competitive online algorithms via a primal-dual approach. Found Trends Theor Comput Sci 3(2–3):93–263

    Article  MathSciNet  MATH  Google Scholar 

  12. Chan H, Megow N, Sitters R, van Stee R (2012) A note on sorting buffers offline. Theor Comput Sci 423:11–18

    Article  MathSciNet  MATH  Google Scholar 

  13. Chen X, Lan Y, Benko A, Dósa G, Han X (2011) Optimal algorithms for online scheduling with bounded rearrangement at the end. Theor Comput Sci 412(45):6269–6278

    Article  MathSciNet  MATH  Google Scholar 

  14. Ding N, Lan Y, Chen X, Dósa G, Guo H, Han X (2014) Online minimum makespan scheduling with a buffer. Int J Found Comput Sci 25(5):525–536

    Article  MathSciNet  MATH  Google Scholar 

  15. Dósa G, Epstein L (2010) Online scheduling with a buffer on related machines. J Comb Optim 20(2):161–179

    Article  MathSciNet  MATH  Google Scholar 

  16. Dósa G, Epstein L (2011) Preemptive online scheduling with reordering. SIAM J Discret Math 25(1):21–49

    Article  MathSciNet  MATH  Google Scholar 

  17. Dósa G, Wang Y, Han X, Guo H (2011) Online scheduling with rearrangement on two related machines. Theor Comput Sci 412(8–10):642–653

    Article  MathSciNet  MATH  Google Scholar 

  18. Englert M, Westermann M (2005) Reordering buffer management for non-uniform cost models. In: Proceedings of the 32nd international colloquium on automata, languages and programming (ICALP), Lisbon, pp 627–638

    Google Scholar 

  19. Englert M, Räcke H, Westermann M (2010) Reordering buffers for general metric spaces. Theory Comput 6(1):27–46

    Article  MathSciNet  MATH  Google Scholar 

  20. Englert M, Özmen D, Westermann M (2014) The power of reordering for online minimum makespan scheduling. SIAM J Comput 43(3):1220–1237

    Article  MathSciNet  MATH  Google Scholar 

  21. Epstein L, Levin A, van Stee R (2011) Max-min online allocations with a reordering buffer. SIAM J Discret Math 25(3):1230–1250

    Article  MathSciNet  MATH  Google Scholar 

  22. Esfandiari H, Hajiaghayi M, Khani MR, Liaghat V, Mahini H, Räcke H (2014) Online stochastic reordering buffer scheduling. In: Proceedings of the 41st international colloquium on automata, languages and programming (ICALP), Copenhagen, pp 465–476

    Google Scholar 

  23. Fakcharoenphol J, Rao SB, Talwar K (2004) A tight bound on approximating arbitrary metrics by tree metrics. J Comput Syst Sci 69(3):485–497

    Article  MathSciNet  MATH  Google Scholar 

  24. Gamzu I, Segev D (2009) Improved online algorithms for the sorting buffer problem on line metrics. ACM Trans Algorithms 6(1):15:1–15:14

    Google Scholar 

  25. Im S, Moseley B (2014) New approximations for reordering buffer management. In: Proceedings of the 25th ACM-SIAM symposium on discrete algorithms (SODA), Portland, pp 1093–1111

    Google Scholar 

  26. Kellerer H, Kotov V, Speranza MG, Tuza Z (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21(5):235–242

    Article  MathSciNet  MATH  Google Scholar 

  27. Khandekar R, Pandit V (2010) Online and offline algorithms for the sorting buffers problem on the line metric. J Discret Algorithms 8(1):24–35

    Article  MathSciNet  MATH  Google Scholar 

  28. Kohrt JS, Pruhs K (2004) A constant factor approximation algorithm for sorting buffers. In: Proceedings of the 6th Latin American symposium on theoretical informatics (LATIN), Buenos Aires, pp 193–202

    Google Scholar 

  29. Räcke H, Sohler C, Westermann M (2002) Online scheduling for sorting buffers. In: Proceedings of the 10th European symposium on algorithms (ESA), Rome, pp 820–832

    Google Scholar 

  30. Tan Z, Yu S (2008) Online scheduling with reassignment. Oper Res Lett 36(2):250–254

    Article  MathSciNet  MATH  Google Scholar 

  31. Wang Y, Benko A, Chen X, Dósa G, Guo H, Han X, Sik-Lányi C (2012) Online scheduling with one rearrangement at the end: revisited. Inform Process Lett 112(16):641–645

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Warwick, CV4 7AL, Coventry, UK

    Matthias Englert

  2. Department of Computer Science, TU Dortmund University, Dortmund, Germany

    Matthias Westermann

Authors
  1. Matthias Englert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Westermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matthias Englert .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Englert, M., Westermann, M. (2016). Scheduling with a Reordering Buffer. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_502

Download citation

Publish with us

Policies and ethics

Search

Navigation