Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SPAA

2004

ACM

2004

ACM

We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric space cooperate with one another to satisfy a sequence of read requests to a collection of read-only ﬁles. A seminal result in the area of competitive analysis states that the ”least recently used” (LRU) paging algorithm is constant-competitive if it is given a constant-factor blowup in capacity over the ofﬂine algorithm. Does such a constant-competitive deterministic algorithm, with a constant-factor blowup in the machine capacities, exist for the hierarchical cooperative caching problem? In this paper, we present a deterministic hierarchical generalization of LRU that is constant-competitive when the capacity blowup is linear in d, the depth of the cache hierarchy. Furthermore, we exhibit an inﬁnite family of depth-d hierarchies such that any randomized hierarchical cooperative caching algorithm with...

Related Content

Added |
30 Jun 2010 |

Updated |
30 Jun 2010 |

Type |
Conference |

Year |
2004 |

Where |
SPAA |

Authors |
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani |

Comments (0)