Skip to main content
SpringerLink
Log in

Randomized online multi-threaded paging

  • Conference paper
  • First Online:
Algorithm Theory — SWAT'98 (SWAT 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1432))

Included in the following conference series:

  • 118 Accesses

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.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albers, S. On the influence of lookahead in competitive paging algorithms. Algorithmica 18, 3 (Jul 1997), 283–305.

    Article  MATH  MathSciNet  Google Scholar 

  2. 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.

    Article  MathSciNet  Google Scholar 

  3. 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.

    Article  MathSciNet  Google Scholar 

  4. 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.

    MathSciNet  Google Scholar 

  5. 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.

    Google Scholar 

  6. 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.

    Article  Google Scholar 

  7. 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.

    Article  MathSciNet  Google Scholar 

  8. Karlin, A., Manasse, M., McGeoch, L., and Owicki, S. Competitive randomized algorithms for nonuniform problems. Algorithmica 11, 6 (Jun 1994), 542–571.

    Article  MathSciNet  Google Scholar 

  9. Karlin, A., Manasse, M., Rudolph, L., and Sleator, D. Competitive snoopy caching. Algorithmica 3, 1 (1988), 79–119.

    Article  MathSciNet  Google Scholar 

  10. Manasse, M., McGeoch, L., and Sleator, D. Competitive algorithms for server problems. Journal of Algorithms 11, 2 (Jun 1990), 208–230.

    Article  MathSciNet  Google Scholar 

  11. McGeoch, L., and Sleator, D. A strongly competitive randomized paging algorithm. Algorithmica 6, 6 (1991), 816–825.

    Article  MathSciNet  Google Scholar 

  12. Motwani, R., and Raghavan, P. Randomized Algorithms. Cambridge University Press, 1997.

    Google Scholar 

  13. P. Cao, E.W. Felten, K. L. Application-controlled file caching policies. In Proc. of the Summer USENIX Conference (1994).

    Google Scholar 

  14. 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.

    Google Scholar 

  15. Sleator, D., and Tarjan, R. Amortized efficiency of list update and paging rules. Communications of the ACM 28, 2 (Feb 1985), 202–208.

    Article  MathSciNet  Google Scholar 

  16. Sleator, D., and Tarjan, R. Self adjusting binary search trees. Journal of the ACM 32, 3 (Jul 1985), 652–686.

    Article  MathSciNet  Google Scholar 

  17. 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.

    Google Scholar 

  18. Von Neumann, J., and Morgenstern, O. Theory of games and economic behavior, 1st ed. Princeton University Press, 1944.

    Google Scholar 

  19. Westbrook, J. Randomized algorithms for multiprocessor page migration. SIAM Journal on Computing 23, 5 (Oct 1994), 951–965.

    Article  MathSciNet  Google Scholar 

  20. 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.

    Google Scholar 

  21. Young, N. The k-server dual and loose competitiveness for paging. Algorithmica 11, 6 (Jun 1994), 525–41.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik B, Technische Universität Graz, Steyrergasse 30/ 2 Stock, A-8010, Graz, Austria

    Steven S. Seiden

Authors
  1. Steven S. Seiden
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stefan Arnborg Lars Ivansson

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation