maximal hit rate

time since last access

We present a technique for determining the best data cache size required for a given memory-intensive application.

is highly sensitive to the stride of data accesses and the size of the blocks, and can cause wide variations in machine performance for different matrix sizes. The conventional wisdom of trying to use the entire cache, or even a fixed fraction of the cache, is incorrect. If a fixed block size is used for a

Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and non

-set theory to build a model that accurately predicts a map-cache’s performance for traffic with time translation invariance of the working-set size. We validate our model empirically using four different packet traces collected in two different campus networks.

This paper discusses the design andperformance of a hierarchical proxy-cache designed to make Internet information systems scale better. The design was motivated by our earlier trace-driven simulation study of Internet traffic. We believe that the conventional wisdom, that the benefits

(ln ~ –lnln ~+~) when &> e, and at most 2 otherwise. We show this is roughly within a factor of two of optimal. Intuitively, we say a paging strategy is loosely Competitive if, for any sequence, at most cache sizes the fault rate of the pa ing strategy is at most an insignificant amount above C

for cache size and improves on heterogeneous architectures, and demonstrates a skeleton-based programming model that simplifies programming heterogeneous architectures. We further demonstrate that the cost model can be exploited by skeletons to improve load balancing on heterogeneous architectures

Abstract not found