Sciweavers

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

8

COMPUTING
2007

favoriteEmaildiscussreport

78views more COMPUTING 2007»

Calculating lower bounds for caching problems

13 years 4 months ago

Calculating lower bounds for caching problems

Download www.mpi-inf.mpg.de

We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For weighted caching, we increase the interval of weights where Fifo is known to be optimal. For companion caching, we give much simpler proofs for several known results, and give a new bound for the case of three types without reorganization or bypassing.

Leah Epstein, Rob van Stee

Real-time Traffic

Caching | Companion Caching | COMPUTING 2007 | Various Caching Problems |

claim paper

Related Content

» Robust Bayesian reinforcement learning through tight lower bounds

» Tightening the Bounds on Feasible Preemption Points

» CacheOblivious ComparisonBased Algorithms on Multisets

» Designing an A Algorithm for Calculating Edit Distance between RootedUnordered Trees

» CacheOblivious OutputSensitive TwoDimensional Convex Hull

» On the Cell Probe Complexity of Dynamic Membership

» Online hierarchical cooperative caching

» On adequate performance measures for paging

» A probabilistic analysis for the range assignment problem in ad hoc networks

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	COMPUTING
Authors	Leah Epstein, Rob van Stee

Comments (0)