— Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeate...
We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a...
In order to achieve better scalability and reduce latency in handling user requests, many Web applications make extensive use of data replication through caches and Content Delive...
Bogdan C. Popescu, Maarten van Steen, Bruno Crispo...
Content distribution networks (CDNs) increase the capacity of individual Web sites and attempt to deliver content from caches that are located "closer" to end-users than...
Alexandros Biliris, Charles D. Cranor, Fred Dougli...
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...