Skip to main content
SpringerLink
Log in

Randomized Weighted Caching with Two Page Weights

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We consider a special case of the weighted caching problem where the weight of every page is either 1 or some fixed number M > 1 . We present a randomized algorithm which achieves a competitive ratio which is O( log k) where k is the number of pages which can fit in the cache.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Information and Computer Science, University of California, Irvine, CA 92697, USA. irani@xena.ics.uci.edu. Supported in part by NSF Grants CCR-0105498 and CCR-9625844 and by ONR Award N00014-00-1-0617., US

    Irani

Authors
  1. Irani
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Irani Randomized Weighted Caching with Two Page Weights . Algorithmica 32, 624–640 (2002). https://doi.org/10.1007/s00453-001-0095-6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-001-0095-6

Search

Navigation