Abstract
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one independent source.
Four different problems arise whether we consider fairness restrictions or not, with finite or infinite input sequences. We study all of them, proving lower and upper bounds for the competitiveness of on-line algorithms.
The main results presented in this paper may be summarized as follows. When no fairness restrictions are imposed it is possible to obtain good competitive ratios; on the other hand, for the fair case in general there exist no competitive algorithms.
Research supported in part by EC project DYNDATA under program KIT, and by UBACYT project “Modelos y Técnicas de Optimización Combinatoria”
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Widgerson. On the power of randomization in online algorithms. Technical Report TR-90-023, ICSI, June 1990.
A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive paging with locality of reference. In Proc. of 23rd ACM Symposium on Theory of Computing, pages 249–259, 1991.
A. Borodin, N. Linial, and M. Saks. An optimal on-line algorithm for metrical task system. J. ACM, 39(4):745–763, 1992.
E. Feuerstein and A. Strejilevich de Loma. On multi-threaded paging. Technical Report TR 96-001, Universidad de Buenos Aires, Departamento de Computación, July 1996. http://www.dc.uba.ar/people/proyinv/tr.html.
A. Fiat and A. Karlin. Randomized and multipointer paging with locality of reference. In Proc. of 27th ACM Symposium on Theory of Computing, 1995.
A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive snoopy caching. Algorithmica, 3:79–119, 1988.
P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. Technical Report RC 15622, IBM, 1990.
D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of ACM, 28:202–208, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feuerstein, E., Strejilevich de Loma, A. (1996). On multi-threaded Paging. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009518
Download citation
DOI: https://doi.org/10.1007/BFb0009518
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62048-8
Online ISBN: 978-3-540-49633-5
eBook Packages: Springer Book Archive