Abstract
We present the first randomized upper and lower bounds for online multi-threaded paging as introduced by Feuerstein and Strejilevich de Loma [5]. Our main result is a O(w log k)-competitive algorithm for unfair infinite multi-threaded paging, which is optimal to within a constant factor. We also present algorithms and lower bounds for three other sub-models of multi-threaded paging.
This research has been supported by the START program Y43-MAT of the Austrian Ministry of Science.
Preview
Unable to display preview. Download preview PDF.
References
Albers, S. On the influence of lookahead in competitive paging algorithms. Algorithmica 18, 3 (Jul 1997), 283–305.
Ben-David, S., Borodin, A., Karp, R., Tardos, G., and Wigderson, A. On the power of randomization in on-line algorithms. Algorithmica 11, 1 (Jan 1994), 2–14.
Borodin, A., Irani, S., Raghavan, P., and Schieber, B. Competitive paging with locality of reference. Journal of Computer and System Sciences 50, 2 (Apr 1995), 244–258.
Borodin, A., Linial, N., and Saks, M. An optimal online algorithm for metrical task system. Journal of the Association for Computing Machinery 39, 4 (Oct 1992), 745–763.
Feuerstein, E., and Strejilevich de Loma, A. On multi-threaded paging. In Proceedings of the 7th International Symposium on Algorithms and Computation (Dec 1996), pp. 417–426.
Fiat, A., Karp, R., Luby, M., McGeoch, L., Sleator, D., and Young, N. Competitive paging algorithms. Journal of Algorithms 12, 4 (Dec 1991), 685–699.
Irani, S., Karlin, A., and Phillips, S. Strongly competitive algorithms for paging with locality of reference. SIAM Journal on Computing 25, 3 (Jun 1996), 477–497.
Karlin, A., Manasse, M., McGeoch, L., and Owicki, S. Competitive randomized algorithms for nonuniform problems. Algorithmica 11, 6 (Jun 1994), 542–571.
Karlin, A., Manasse, M., Rudolph, L., and Sleator, D. Competitive snoopy caching. Algorithmica 3, 1 (1988), 79–119.
Manasse, M., McGeoch, L., and Sleator, D. Competitive algorithms for server problems. Journal of Algorithms 11, 2 (Jun 1990), 208–230.
McGeoch, L., and Sleator, D. A strongly competitive randomized paging algorithm. Algorithmica 6, 6 (1991), 816–825.
Motwani, R., and Raghavan, P. Randomized Algorithms. Cambridge University Press, 1997.
P. Cao, E.W. Felten, K. L. Application-controlled file caching policies. In Proc. of the Summer USENIX Conference (1994).
R. D. Barve, E. F. Grove, J. S. V. Application-controlled paging for a shared cache. In Proc. 36th Symp. on Foundations of Computer Science (1995), pp. 204–213.
Sleator, D., and Tarjan, R. Amortized efficiency of list update and paging rules. Communications of the ACM 28, 2 (Feb 1985), 202–208.
Sleator, D., and Tarjan, R. Self adjusting binary search trees. Journal of the ACM 32, 3 (Jul 1985), 652–686.
Strejilevich de Loma, A. New results on fair multi-threaded paging. In Proceedings of the 1st Argentine Workshop on Theoretical Informatics (1997), pp. 111–122.
Von Neumann, J., and Morgenstern, O. Theory of games and economic behavior, 1st ed. Princeton University Press, 1944.
Westbrook, J. Randomized algorithms for multiprocessor page migration. SIAM Journal on Computing 23, 5 (Oct 1994), 951–965.
Yao, A. C. C. Probabilistic computations: Toward a unified measure of complexity. In Proc. 18th IEEE Symposium on Foundations of Computer Science (FOCS) (1977), pp. 222–227.
Young, N. The k-server dual and loose competitiveness for paging. Algorithmica 11, 6 (Jun 1994), 525–41.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seiden, S.S. (1998). Randomized online multi-threaded paging. In: Arnborg, S., Ivansson, L. (eds) Algorithm Theory — SWAT'98. SWAT 1998. Lecture Notes in Computer Science, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054374
Download citation
DOI: https://doi.org/10.1007/BFb0054374
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64682-2
Online ISBN: 978-3-540-69106-8
eBook Packages: Springer Book Archive