Journal Article10.1007/S12083-009-0047-5
SPACE: A lightweight collaborative caching for clusters
TL;DR: Systematic P2P Aided Cache Enhancement or SPACE, a new collaboration scheme among clients in a computer cluster of a high performance computing facility to share their caches with each other, is introduced.
read more
Abstract: In this paper, we introduce Systematic P2P Aided Cache Enhancement or SPACE, a new collaboration scheme among clients in a computer cluster of a high performance computing facility to share their caches with each other. The collaboration is achieved in a distributed manner, and is designed based on peer-to-peer computing model. The objective is to provide (1) a decentralized solution, and (2) a near optimal performance with reasonably low overhead. Simulation results are given to demonstrate the performance of the proposed scheme. In addition, the results show that SPACE evenly distributes work loads among participators, and entirely eliminates any requirement of a central cache manager.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
OUR: Optimal Update‐based Replacement policy for cache in wireless data access networks with optimal effective hits and bandwidth requirements
TL;DR: Both analysis and extensive simulation results were given to demonstrate that the proposed schemes guarantee optimal amount of data transmission by increasing the number of effective hits and outperform the popular Least Frequently Used scheme in terms of both effective Hits and communication cost.
A bandwidth and effective hit optimal cache scheme for wireless data access networks with client injected updates
TL;DR: It is analytically prove that a cache system, with a combination of the cache access and replacement policy, guarantees the optimal number of effective cache hits and optimal cost (in terms of network bandwidth) per data object access.
7
Hit Optimal Cache for Wireless Data Access
Mohammad Mursalin Akon,Mohammad Towhidul Islam,Xuemin Shen,Ajit Singh +3 more
- 01 Dec 2010
TL;DR: This paper formalizes the concept of caching frequently accessed but infrequently updated data objects, and proposes a cache replacement policy accordingly, and demonstrates that the proposed policies outperform the popular Least Frequently Used (LFU) scheme in terms of effective hits.
4
Scalable Cooperative Caching Algorithm based on Bloom Filters
Nodirjon Siddikov
- 01 Jan 2011
TL;DR: The design, implementation and evaluation of a novel cooperative caching algorithm, called SKALA, which is based on the bloom filter data structure, demonstrate that it is more scalable compared to existing algorithms and shows a significant reduction in the memory overhead.
•Dissertation
Collaborative Data Access and Sharing in Mobile Distributed Systems
Mohammad Towhidul Islam
- 24 Oct 2011
TL;DR: A novel Spatial-Popularity based Information Diffusion (SPID) scheme that determines urgency of contents based on the spatial demand of mobile users and disseminates content accordingly is proposed, and an analytical model of object propagation in mobile networks as a function of node densities, radio range, and node speed is presented.
References
•Book
Computer Architecture: A Quantitative Approach
John L. Hennessy,David A. Patterson +1 more
- 01 Dec 1989
TL;DR: This best-selling title, considered for over a decade to be essential reading for every serious student and practitioner of computer design, has been updated throughout to address the most important trends facing computer designers today.
12.6K
A scalable content-addressable network
Sylvia Ratnasamy,Paul Francis,Mark Handley,Richard M. Karp,Scott Shenker +4 more
- 27 Aug 2001
TL;DR: The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
7.2K
The Google file system
Sanjay Ghemawat,Howard Gobioff,Shun-Tak Albert Leung +2 more
- 19 Oct 2003
TL;DR: This paper presents file system interface extensions designed to support distributed applications, discusses many aspects of the design, and reports measurements from both micro-benchmarks and real world use.
Web caching and Zipf-like distributions: evidence and implications
Lee Breslau,Pei Cao,Li Fan,G. Phillips,Scott Shenker +4 more
- 21 Mar 1999
TL;DR: This paper investigates the page request distribution seen by Web proxy caches using traces from a variety of sources and considers a simple model where the Web accesses are independent and the reference probability of the documents follows a Zipf-like distribution, suggesting that the various observed properties of hit-ratios and temporal locality are indeed inherent to Web accesse observed by proxies.
A case for redundant arrays of inexpensive disks (RAID)
David A. Patterson,Garth A. Gibson,Randy H. Katz +2 more
- 01 Jun 1988
TL;DR: Five levels of RAIDs are introduced, giving their relative cost/performance, and a comparison to an IBM 3380 and a Fujitsu Super Eagle is compared.