loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First IEEE International Symposium on Cluster Computing and the Grid (CCGrid'01)
Parallel Pull-Based LRU: A Request Distribution Algorithm for Clustered Web Caches Using a DSM for Memory Mapped Networks
Brisbane, Australia
May 15-May 18
ISBN: 0-7695-1010-8
Emmanuel Cecchet, INRIA - SIRAC laboratory
The SIRAC laboratory has developed SciFS, a Distributed Shared Memory (DSM) that tries to benefit from the high performances and the remote addressing capabilities of the Scalable Coherent Interface (SCI) memory mapped network. We use SciFS for high performance cluster computing and we also experiment with it to build large scale clustered web caches./We propose Whoops! a clustered web cache prototype with a new request distribution algorithm, called PPBL (Parallel Pull-Based LRU), especially designed for use with a memory mapped network and a DSM system. Unlike other distribution algorithms the decision is distributed over all nodes thus providing better scalability. We evaluate a first PPBL implementation and discuss scalability issues. Then, we propose a solution to build a scalable implementation of PPBL. We conclude with other improvements that can be achieved to build efficient large scale clustered web caches using a DSM over memory mapped networks.
Citation:
Emmanuel Cecchet, "Parallel Pull-Based LRU: A Request Distribution Algorithm for Clustered Web Caches Using a DSM for Memory Mapped Networks," ccgrid, pp.533, First IEEE International Symposium on Cluster Computing and the Grid (CCGrid'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.