Towards Transparent Throughput Elasticity for IaaS Cloud Storage: Exploring the Benefits of Adaptive Block-Level Caching

doi:10.4018/IJDST.2015100102

Title: Towards Transparent Throughput Elasticity for IaaS Cloud Storage: Exploring the Benefits of Adaptive Block-Level Caching

Full Record
Other Related Research

Abstract

Storage elasticity on IaaS clouds is a crucial feature in the age of data-intensive computing, especially when considering fluctuations of I/O throughput. This paper provides a transparent solution that automatically boosts I/O bandwidth during peaks for underlying virtual disks, effectively avoiding over-provisioning without performance loss. The authors' proposal relies on the idea of leveraging short-lived virtual disks of better performance characteristics (and thus more expensive) to act during peaks as a caching layer for the persistent virtual disks where the application data is stored. Furthermore, they introduce a performance and cost prediction methodology that can be used both independently to estimate in advance what trade-off between performance and cost is possible, as well as an optimization technique that enables better cache size selection to meet the desired performance level with minimal cost. The authors demonstrate the benefits of their proposal both for microbenchmarks and for two real-life applications using large-scale experiments.

Authors:

Nicolae, Bogdan ^[1]; Riteau, Pierre ^[2]; Keahey, Kate ^[3]

IBM Research, Dublin, Ireland
University of Chicago, Chicago, IL, USA
Argonne National Laboratory, Lemont, IL, USA

Publication Date:: 2015-10-01

Research Org.:: Argonne National Lab. (ANL), Argonne, IL (United States)

Sponsoring Org.:: USDOE Office of Science (SC)

OSTI Identifier:: 1391885

DOE Contract Number:: AC02-06CH11357

Resource Type:: Journal Article

Journal Name:: International Journal of Distributed Systems and Technologies

Additional Journal Information:: Journal Volume: 6; Journal Issue: 4; Journal ID: ISSN 1947-3532

Country of Publication:: United States

Language:: English

Citation Formats


                    Nicolae, Bogdan, Riteau, Pierre, and Keahey, Kate. Towards Transparent Throughput Elasticity for IaaS Cloud Storage: Exploring the Benefits of Adaptive Block-Level Caching.  United States: N. p., 2015. 
        Web.  doi:10.4018/IJDST.2015100102.

Copy to clipboard


                    Nicolae, Bogdan, Riteau, Pierre, & Keahey, Kate. Towards Transparent Throughput Elasticity for IaaS Cloud Storage: Exploring the Benefits of Adaptive Block-Level Caching.  United States.  doi:10.4018/IJDST.2015100102.

Copy to clipboard


                    Nicolae, Bogdan, Riteau, Pierre, and Keahey, Kate. Thu .  
        "Towards Transparent Throughput Elasticity for IaaS Cloud Storage: Exploring the Benefits of Adaptive Block-Level Caching".  United States.  doi:10.4018/IJDST.2015100102.

Copy to clipboard


                    
@article{osti_1391885,

  title        = {Towards Transparent Throughput Elasticity for IaaS Cloud Storage: Exploring the Benefits of Adaptive Block-Level Caching},

  author       = {Nicolae, Bogdan and Riteau, Pierre and Keahey, Kate},

  abstractNote = {Storage elasticity on IaaS clouds is a crucial feature in the age of data-intensive computing, especially when considering fluctuations of I/O throughput. This paper provides a transparent solution that automatically boosts I/O bandwidth during peaks for underlying virtual disks, effectively avoiding over-provisioning without performance loss. The authors' proposal relies on the idea of leveraging short-lived virtual disks of better performance characteristics (and thus more expensive) to act during peaks as a caching layer for the persistent virtual disks where the application data is stored. Furthermore, they introduce a performance and cost prediction methodology that can be used both independently to estimate in advance what trade-off between performance and cost is possible, as well as an optimization technique that enables better cache size selection to meet the desired performance level with minimal cost. The authors demonstrate the benefits of their proposal both for microbenchmarks and for two real-life applications using large-scale experiments.},

  doi          = {10.4018/IJDST.2015100102},

  journal      = {International Journal of Distributed Systems and Technologies},

  issn         = {1947-3532},

  number       = 4,

  volume       = 6,

  place        = {United States},

  year         = {2015},

  month        = {10}

}

Copy to clipboard

Journal Article:

DOI: 10.4018/IJDST.2015100102

Other availability

Find in Google Scholar

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Multi-level Hybrid Cache: Impact and Feasibility

Technical Report Zhang, Zhe ; Kim, Youngjae ; Ma, Xiaosong ; ...

Storage class memories, including flash, has been attracting much attention as promising candidates fitting into in today's enterprise storage systems. In particular, since the cost and performance characteristics of flash are in-between those of DRAM and hard disks, it has been considered by many studies as an secondary caching layer underneath main memory cache. However, there has been a lack of studies of correlation and interdependency between DRAM and flash caching. This paper views this problem as a special form of multi-level caching, and tries to understand the benefits of this multi-level hybrid cache hierarchy. We reveal that significant costsmore »« less
DOI: 10.2172/1035823

Full Text Available
A Unified Multiple-Level Cache for High Performance Storage Systems

Journal Article He, X. ; Ou, Li ; Kosa, Martha J. ; ... - International Journal of High Performance Computing and Networking

Multi-level cache hierarchies are widely used in high-performance storage systems to improve I/O performance. However, traditional cache management algorithms are not suited well for such cache organizations. Recently proposed multi-level cache replacement algorithms using aggressive exclusive caching work well with single or multiple-client, low-correlated workloads, but suffer serious performance degradation with multiple-client, high-correlated workloads. In this paper, we propose a new cache management algorithm that handles multi-level buffer caches by forming a unified cache (uCache), which uses both exclusive caching in L2 storage caches and cooperative client caching. We also propose a new local replacement algorithm, Frequency Based Eviction-Reference (FBER),more »« less
DOI: 10.1504/IJHPCN.2007.015768
Virtual machine provisioning, code management, and data movement design for the Fermilab HEPCloud Facility

Journal Article Timm, S. ; Cooper, G. ; Fuess, S. ; ... - Journal of Physics. Conference Series

The Fermilab HEPCloud Facility Project has as its goal to extend the current Fermilab facility interface to provide transparent access to disparate resources including commercial and community clouds, grid federations, and HPC centers. This facility enables experiments to perform the full spectrum of computing tasks, including data-intensive simulation and reconstruction. We have evaluated the use of the commercial cloud to provide elasticity to respond to peaks of demand without overprovisioning local resources. Full scale data-intensive workflows have been successfully completed on Amazon Web Services for two High Energy Physics Experiments, CMS and NOνA, at the scale of 58000 simultaneous cores.more »« less
DOI: 10.1088/1742-6596/898/5/052041

Full Text Available
Improving Data Availability for Better Access Performance: A Study on Caching Scientific Data on Distributed Workstations

Journal Article Ma, Xiaosong ; Zhang, Zhe ; Vazhkudai, Sudharshan S - Journal of Grid Computing

Client-side data caching serves as an excellent mechanism to store and analyze the rapidly growing amount of scientific data. In our previous work, we built a distributed local cache on unreliable desktop storage contributions. This offers several desirable properties, such as performance impedance matching, improved space utilization, and high parallel I/O bandwidth. Such a low-cost, best-effort cache, however, is faced with the vagaries of storage node availability: these donated machines may be significantly less reliable than dedicated systems and cannot be controlled centrally. In this paper, we address %the tradeoffs between techniques that favor %availability or performance when it comesmore »« less
DOI: 10.1007/s10723-009-9122-7
Distributed data access in the sequential access model at the D0 experiment at Fermilab

Conference Igor Terekhov ; Victoria White

The authors present the Sequential Access Model (SAM), which is the data handling system for D0, one of two primary High Energy Experiments at Fermilab. During the next several years, the D0 experiment will store a total of about 1 PByte of data, including raw detector data and data processed at various levels. The design of SAM is not specific to the D0 experiment and carries few assumptions about the underlying mass storage level; its ideas are applicable to any sequential data access. By definition, in the sequential access mode a user application needs to process a stream of data,more »« less
Full Text Available

Similar Records