ULC: a file block placement and replacement protocol to effectively exploit hierarchical locality in multi-level buffer caches

Jiang, Song; Zhang, X.

doi:10.1109/icdcs.2004.1281581

Cited by 39 publications

(43 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reuse distance has also been introduced into the management of hierarchical multi-level caches in a clientserver system using the Unified Level-aware Caching (ULC) protocol [24]. There are two major differences between the ULC protocol and the LAC protocol presented here.…”

Section: Related Work On Reuse Distance and Localitymentioning

confidence: 99%

“…server protocols such as ULC [24] and DEMOTE [19]. Even if this redundancy were effectively addressed, it would not reduce the value of cooperative caching on the client side because cooperative caching allows cache size to increase in proportion to the number of clients, while the effective cache size of the server for each client decreases with increasing number of clients.…”

Section: General Workload Performancementioning

confidence: 99%

See 1 more Smart Citation

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

Section: Related Work On Reuse Distance and Localitymentioning

confidence: 99%

Section: General Workload Performancementioning

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

show abstract

“…Gniady et al [13] and Kim et al [14] partition the shared file system cache between multiple processes by detecting the access patterns. Jiang and Zhang [9] partition server buffers dynamically among the clients in accordance to their working set sizes. Gill and Modha [27] partition the cache dynamically among sequential and random I/O streams in order to reduce the read misses in the cache.…”

Section: Related Workmentioning

confidence: 99%

“…We refer to the kernel buffer cache that resides in main memory as the "storage cache." Extensive research [2], [3], [4], [5], [6], [7], [8], [9] has been done on improving the effectiveness of storage caching. However, little research has been done on providing quality of service (QoS) guarantees to multiple applications that exercise storage caches.…”

Section: Introductionmentioning

confidence: 99%

Improving I/O performance using soft-QoS-based dynamic storage cache partitioning

Patrick¹,

Garg²,

Son

et al. 2009

2009 IEEE International Conference on Cluster Computing and Workshops

View full text Add to dashboard Cite

Abstract-Resources are often shared to improve resource utilization and reduce costs. However, not all resources exhibit good performance when shared among multiple applications. The work presented here focuses on effectively managing a shared storage cache. To provide differentiated services to applications exercising a storage cache, we propose a novel scheme that uses curve fitting to dynamically partition the storage cache. Our scheme quickly adapts to application execution, showing increasing accuracy over time. It satisfies application QoS if it is possible to do so, maximizes the individual hit rates of the applications utilizing the cache, and consequently increases the overall storage cache hit rate. Through extensive trace-driven simulation, we show that our storage cache partitioning strategy not only effectively insulates multiple applications from one another but also provides QoS guarantees to applications over a long period of execution time. Using our partitioning strategy, we were able to increase the individual storage cache hit rates of the applications by 67% and 53% over the no-partitioning and equalpartitioning schemes, respectively. Additionally, we improved the overall cache hit rates of the entire storage system by 11% and 12.9% over the no-partitioning and equal-partitioning schemes, respectively, while meeting the QoS goals all the time.

show abstract

“…One major problem is that the locality information embedded in the streams of access requests from clients is not consistently analyzed and exploited, resulting in globally nonsystematic, and therefore suboptimal, placement and replacement of cached blocks across the hierarchy. We have proposed a coordinated multilevel cache management protocol based on consistent accesslocality quantification and show its effectiveness in different platforms [10,11].…”

Section: Buffer Management In Multilevel Caching Systemsmentioning

confidence: 99%

Locality-aware Buffer Management: Algorithms Design and Systems Implementation for Data Intensive Applications (A Brief Progress Report)

Zhang

2007

2007 IEEE International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

show abstract

ULC: a file block placement and replacement protocol to effectively exploit hierarchical locality in multi-level buffer caches

Cited by 39 publications

References 4 publications

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

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

Improving I/O performance using soft-QoS-based dynamic storage cache partitioning

Locality-aware Buffer Management: Algorithms Design and Systems Implementation for Data Intensive Applications (A Brief Progress Report)

Contact Info

Product

Resources

About