Implementing cooperative prefetching and caching in a globally-managed memory system

Voelker, Geoffrey M.; Anderson, Eric; Kimbrel, Tracy; Feeley, Michael J.; Chase, Jeffrey S.; Karlin, Anna R.; Levy, Henry M.

doi:10.1145/277851.277869

Cited by 58 publications

(33 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These researches focus on the benefits of cooperative caching. Prior studies in these contexts include simulation experiments [12], prototypes [13], and analytical results and algorithms [14]. Most of the above-mentioned works have focused on minimizing access latency.…”

Section: Related Workmentioning

confidence: 99%

Enhance Performance of Content Delivery Network Using Provider Oriented Hierarchical Corporative Proposal

Anh¹,

Huu²,

Nguyen³

et al. 2014

IJCA

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Enhance Performance of Content Delivery Network Using Provider Oriented Hierarchical Corporative Proposal

Anh¹,

Huu²,

Nguyen³

et al. 2014

IJCA

View full text Add to dashboard Cite

show abstract

“…Systems employing such techniques include GMS (Global Memory System) [10] and PGMS (Prefetching Global Memory System) [11]. Since cooperative caching was first proposed, the technical trend that originally motivated it-the increasing performance gap between processor and diskhas only grown more pronounced.…”

Section: Cooperative Cachingmentioning

confidence: 99%

Improving Networked File System Performance Using a Locality-Aware Cooperative Cache Protocol

Jiang

Zhang

Liang

et al. 2010

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-In a distributed environment the utilization of file buffer caches in different clients may greatly vary. Cooperative caching has been proposed to increase cache utilization by coordinating the shared usage of distributed caches. It allows clients that would more greatly benefit from larger caches to forward data objects to peer clients with relatively underutilized caches. To support such coordination, global cache utilization must be dynamically evaluated. This in turn requires an effective analysis of application data access patterns. Existing coordination protocols are demonstrably suboptimal in this respect, exhibiting inefficient memory utilization and undue interference among clients. We propose a locality-aware cooperative caching protocol, called LAC, that is based on analysis and manipulation of data-block reuse distance to effectively predict cache utilization and the probability of data reuse at each client. Using a dynamically adaptive synchronization technique, we keep local information up to date and consistently comparable across clients. The system is highly scalable in the sense that global coordination is achieved without centralized control. We have conducted thorough trace-driven simulation experiments to assess the performance differences between LAC and various existing protocols representative of the general class. Using a realistic and representative cost model, we show that the LAC protocol significantly and consistently outperforms existing cooperative caching protocols, demonstrating high and balanced utilization of caches across all clients. In our experiments LAC reduces block access time by up to 36%, with an average of 31%, over the system without peer cache coordination, and reduces block access time by up to 22%, with an average of 13%, over the best performer of the existing protocols.

show abstract

“…It also proposes and validates routing Supprimé : [23] strategies based on random polling which is well adapted for short requests (less than 100 milliseconds) but does not work for longer transactions. The GMS project [50] uses global information to optimize page replacement and pre-fetching decisions over the cluster. However, it mainly addresses specific Internet applications such as the Porcupine mail server.…”

Section: Load Balancing In Database Clustersmentioning

confidence: 99%

The leganet system: Freshness-aware transaction routing in a database cluster

Gançarski¹,

Naacke²,

Pacitti³

et al. 2007

Information Systems

View full text Add to dashboard Cite

Abstract. We consider the use of a database cluster for Application Service Provider (ASP). In the ASP context, applications and databases can be update-intensive and must remain autonomous. In this paper, we describe the Leganet system which performs freshness-aware transaction routing in a database cluster. We use multi-master replication and relaxed replica freshness to increase load balancing. Our transaction routing takes into account freshness requirements of queries at the relation level and uses a cost function that takes into account the cluster load and the cost to refresh replicas to the required level. We implemented the Leganet prototype on a 11-node Linux cluster running Oracle8i. Using experimentation and emulation up to 128 nodes, our validation based on the TPC-C benchmark demonstrates the performance benefits of our approach.

show abstract

Implementing cooperative prefetching and caching in a globally-managed memory system

Cited by 58 publications

References 26 publications

Enhance Performance of Content Delivery Network Using Provider Oriented Hierarchical Corporative Proposal

Enhance Performance of Content Delivery Network Using Provider Oriented Hierarchical Corporative Proposal

Improving Networked File System Performance Using a Locality-Aware Cooperative Cache Protocol

The leganet system: Freshness-aware transaction routing in a database cluster

Contact Info

Product

Resources

About