By Topic

Parallel pull-based LRU: a request distribution algorithm for clustered Web caches using a DSM for memory mapped networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Cecchet, E. ; SIRAC Lab., Inst. Nat. de Recherche en Inf. et Autom., France

The SIRAC laboratory has developed SciFS, a distributed shared memory (DSM) that tries to benefit from the high performance 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

Published in:

Cluster Computing and the Grid, 2001. Proceedings. First IEEE/ACM International Symposium on

Date of Conference: