A Utility-based Approach to Cost-Aware Caching in Heterogeneous Storage Systems

Chakraborty, Liton; Singh, Ajit

doi:10.1109/ipdps.2007.370240

Cited by 6 publications

(7 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The variants of the cache partitioning problem that we discussed arise in various other contexts such as hardware caches [21], web caches [11], storage caches [27][28][29][30], and in database cache management [20,31]. These papers are focused on fair service differentiation and QoS goals [11,20,28], maximizing the total cache hit rate [21,31], or a combination of the two as in SC2 [27,29].…”

Section: Related Workmentioning

confidence: 99%

Design and implementation of caching services in the cloud

2011

View full text Add to dashboard Cite

Data caching is a key paradigm for improving the performance of web services in terms of both end-user latency and database load. Such caching is becoming an essential component of any application or service designed for the cloud platform. In order to allow hosted applications to benefit from caching capabilities while avoiding dependence on explicit implementations and idiosyncrasies of internal caches, the caching services should be offered by a cloud provider as an integral part of its platform-as-a-service portfolio. We highlight various challenges associated with supporting cloud-based caching services, such as identifying the appropriate metering and service models, performance management, and resource sharing across cloud tenants. We also describe how these challenges were addressed by our prototype implementation, which is called Simple Cache for Cloud (SC2). We demonstrate the effectiveness of these techniques by experimentally evaluating our prototype on a synthetic multitenant workload.

show abstract

Section: Related Workmentioning

confidence: 99%

Design and implementation of caching services in the cloud

2011

View full text Add to dashboard Cite

show abstract

“…Rafique et al discuss a architectural support for OS management of shared caches after recognizing the tradeoff between replacement policy flexibility and performance in shared caches [23]. Chakraborty et al propose a utility based caching scheme for storage caches [27].…”

Section: Related Workmentioning

confidence: 99%

Intra-application cache partitioning

Muralidhara

Kandemir

Raghavan

2010

2010 IEEE International Symposium on Parallel &Amp; Distributed Processing (IPDPS)

View full text Add to dashboard Cite

Efficient management of shared on-chip resources such as the shared level 2 (L2) cache has become an important problem with the emergence of chip multiprocessors (CMPs). Partitioning the shared cache in chip multiprocessors (CMPs) among concurrently executing applications can provide important benefits such as throughput improvement, fairness guarantees, and quality of service (QoS) enhancements. In this paper, we pose an interesting related question, which is, if partitioning the shared cache space among concurrently executing threads of the same application can enhance the application performance. We address this problem by identifying and speeding up the slowest thread, also termed as the critical path thread, during each execution interval since the overall performance of a multithreaded application is determined by the critical path thread. To do so, we propose a dynamic, runtime system based, cache partitioning scheme that partitions the shared cache space dynamically among the individual threads of a given application. In a nutshell, we wish to take some cache space away from the faster threads and give it to the critical path thread at each execution interval. We show that speeding up the critical path thread this way, results in overall performance enhancement of the application execution in the long term. Our experimental evaluation indicates that, the proposed dynamic cache partitioning scheme yields benefits up to 15% over a shared cache with no partitions, up to 23% over a statically partitioned cache (private cache) and up to 20% over a throughput-oriented scheme.

show abstract

“…Our work considers non-uniform access costs of the disk blocks, exploits the cost correlation among the cached blocks and at the same time re-uses the existing cost-oblivious caching algorithms. Preliminary versions of this work appeared in [8,9].…”

Section: Related Workmentioning

confidence: 99%

Cost-aware caching schemes in heterogeneous storage systems

Chakraborty

Singh

2009

J Supercomput

Self Cite

View full text Add to dashboard Cite

Modern single-and multi-processor computer systems incorporate, either directly or through a LAN, a number of storage devices with diverse performance characteristics. These storage devices have to deal with workloads with unpredictable burstiness. A storage-aware caching scheme-that partitions the cache among the disks, and aims at balancing the work across the disks-is necessary in this environment. Moreover, maintaining proper size for these partitions is crucial. Adjusting the partition size after each epoch (a certain time interval) assumes that the workload in the subsequent epoch will show similar characteristics as observed in the current epoch. However, in an environment with highly bursty and time-varying workload such an approach seems to be optimistic. Moreover, the existing storage-aware caching schemes assume linear relationship between cache size and hit ratio. But, in practice a (disk) partition may accumulate cache blocks (thus, choke the remaining disks) without increasing the hit ratio significantly. This disk choking phenomenon may degenerate the performance of the disk system. In this paper, we address the issues of continuous repartitioning and disk choking. First, we present a caching scheme that continuously adjusts the partition size forgoing any periodic activity. Later, considering the disk choking issue, we present a repartitioning framework based on the notion of marginal gains. Experimental results show the effectiveness of our approach. We show that our scheme outperforms the existing storage-aware caching schemes.

show abstract

A Utility-based Approach to Cost-Aware Caching in Heterogeneous Storage Systems

Abstract: Abstract

Cited by 6 publications

References 22 publications

Design and implementation of caching services in the cloud

Design and implementation of caching services in the cloud

Intra-application cache partitioning

Cost-aware caching schemes in heterogeneous storage systems

Contact Info

Product

Resources

About