Parallel Pull-Based LRU : a New Request Distribution Algorithm for Large Scale SCI Clustered Web Caches
نویسندگان
چکیده
The SIRAC laboratory has developed SciFS, a Distributed Shared Memory (DSM) tightly integrated with the Linux operating system kernel, that exploits the high performance and remote addressing capabilities of SCI (Scalable Coherent Interface) networks. We experiment with using SciFS to build large scale clustered web caches. An efficient DSM does not only provide a fast and large data storage space, but it also allows the design of new algorithms to handle user requests. * We propose a clustered web cache prototype with a new request distribution algorithm, called PPBL (Parallel Pull-Based LRU), especially designed for use with a DSM system. Unlike other distribution algorithms the decision is distributed over all nodes thus providing better scalability. In this short paper, we only present PPBL principles but additional information can be found on our web site at http://sci-serv.inrialpes.fr.
منابع مشابه
Parallel Pull-Based LRU: A Request Distribution Algorithm for Clustered Web Caches Using a DSM for Memory Mapped Networks
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 but we now experiment with it to build large scale clustered web caches. We propose Whoops! a clustered web cache pro...
متن کاملWhoops! : A Clustered Web Cache for DSM Systems using Memory Mapped Networks
In this paper, we present Whoops!, a clustered web cache prototype based on SciFS, a Distributed Shared Memory (DSM) that benefits from the high performances and the remote addressing capabilities of memory mapped networks like Scalable Coherent Interface (SCI). Whoops! uses the DSM for all web cache management and cache storage. Using a memory mapped network and a DSM programming model allow u...
متن کاملLRU Caching with Moderately Heavy Request Distributions
Majority of practical caching algorithms, in particular those used in the World Wide Web applications, are based on the so-called Least-Recently-Used (LRU) cache replacement heuristic whose desirable attributes include low complexity, quick adaptability and high cache hit (low fault) probability. Recent studies have developed asymptotic characterization of the LRU fault probability for the gene...
متن کاملAsymptotic Insensitivity of Least-Recently-Used Caching to Statistical Dependency
We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility for modeling strong statistical correlation, including the broadly reported long-range dependence in the World Wide Web page request patterns. When the frequency of requesting a page n is equal to the generalized Zipf’s law c/n, ...
متن کاملParallel Cache Management Protocol for Static and Dynamic Web Contents
This paper studies Random Request Distribution and Load Balancing Cache protocol (RLC) and Randomly Selected and Limited Look at neighbor (RSLL) cache algorithm based on Byte Access Frequency Factor (BAFF) for internet services with multimedia and dynamic web content. The RSLL cache algorithm considers reducing response time and achieving good load balance among web servers using limitation of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000