Abstract
In the reordering buffer management problem, a sequence of colored items arrives at a service station to be processed. Each color change between two consecutively processed items generates cost. A reordering buffer of capacity k items can be used to preprocess the input sequence in order to decrease the number of color changes. The goal is to find a scheduling strategy that, using the reordering buffer, minimizes the number of color changes in the given sequence of items.
We consider the problem in the setting of online computation with advice. In this model, the color of an item becomes known only at the time when the item enters the reordering buffer. Additionally, together with each item entering the buffer, we get a fixed number of advice bits, which can be seen as information about the future or as information about an optimal solution (or an approximation thereof) for the whole input sequence. We show that for any ε > 0 there is a (1 + ε)-competitive algorithm for the problem which uses only a constant (depending on ε) number of advice bits per input item.
We complement the above result by presenting a lower bound of Ω(logk) bits of advice per request for an optimal deterministic algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adamaszek, A., Czumaj, A., Englert, M., Räcke, H.: Almost tight bounds for reordering buffer management. In: Fortnow, L., Vadhan, S.P. (eds.) STOC, pp. 607–616. ACM (2011)
Asahiro, Y., Kawahara, K., Miyano, E.: NP-hardness of the sorting buffer problem on the uniform metric. Discrete Applied Mathematics 160(10-11), 1453–1464 (2012)
Avigdor-Elgrabli, N., Rabani, Y.: An improved competitive algorithm for reordering buffer management. In: Charikar, M. (ed.) SODA, pp. 13–21. SIAM (2010)
Avigdor-Elgrabli, N., Rabani, Y.: A constant factor approximation algorithm for reordering buffer management. In: Khanna, S. (ed.) SODA, pp. 973–984. SIAM (2013)
Avigdor-Elgrabli, N., Rabani, Y.: An optimal randomized online algorithm for reordering buffer management. CoRR abs/1303.3386 (2013)
Blandford, D.K., Blelloch, G.E.: Index compression through document reordering. In: DCC, pp. 342–351. IEEE Computer Society (2002)
Böckenhauer, H.J., Komm, D., Královic, R., Královic, R.: On the advice complexity of the k-server problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 207–218. Springer, Heidelberg (2011)
Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R., Mömke, T.: On the advice complexity of online problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 331–340. Springer, Heidelberg (2009)
Chan, H.-L., Megow, N., Sitters, R., Stee, R.v.: A note on sorting buffers offline. Theor. Comput. Sci. 423, 11–18 (2012)
Dobrev, S., Královič, R., Pardubská, D.: How much information about the future is needed? In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 247–258. Springer, Heidelberg (2008)
Emek, Y., Fraigniaud, P., Korman, A., Rosén, A.: Online computation with advice. Theor. Comput. Sci. 412(24), 2642–2656 (2011)
Englert, M., Räcke, H., Westermann, M.: Reordering buffers for general metric spaces. Theory of Computing 6(1), 27–46 (2010)
Englert, M., Westermann, M.: Reordering buffer management for non-uniform cost models. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 627–638. Springer, Heidelberg (2005)
Gutenschwager, K., Spiekermann, S., Voß, S.: A sequential ordering problem in automotive paint shops. Internat. J. Production Research 42(9), 1865–1878 (2004)
Hromkovič, J., Královič, R., Královič, R.: Information complexity of online problems. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 24–36. Springer, Heidelberg (2010)
Komm, D., Královic, R.: Advice complexity and barely random algorithms. RAIRO - Theor. Inf. and Applic. 45(2), 249–267 (2011)
Krokowski, J., Räcke, H., Sohler, C., Westermann, M.: Reducing state changes with a pipeline buffer. In: Girod, B., Magnor, M.A., Seidel, H.P. (eds.) VMV, p. 217. Aka GmbH (2004)
Räcke, H., Sohler, C., Westermann, M.: Online scheduling for sorting buffers. In: Möhring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 820–832. Springer, Heidelberg (2002)
Renault, M.P., Rosén, A.: On online algorithms with advice for the k-server problem. Theory of Computing Systems, 1–19 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Adamaszek, A., Renault, M.P., Rosén, A., van Stee, R. (2014). Reordering Buffer Management with Advice. In: Kaklamanis, C., Pruhs, K. (eds) Approximation and Online Algorithms. WAOA 2013. Lecture Notes in Computer Science, vol 8447. Springer, Cham. https://doi.org/10.1007/978-3-319-08001-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-08001-7_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08000-0
Online ISBN: 978-3-319-08001-7
eBook Packages: Computer ScienceComputer Science (R0)