Access the full text.
Sign up today, get DeepDyve free for 14 days.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, A. Veitch (2002)
Hippodrome: Running circles around storage administrationProc, 13
G. A. Alvarez, E. Borowsky, S. Go, T. H. Romer, R. Becker-Szendy, R. Golding, A. Merchant, M. Spasojevic, A. Veitch, J. Wilkes (2001)
Minerva: An automated resource provisioning tool for large-scale storage systemsACM Trans. Comput. Syst., 19
EMC Corporation (2013)
White Paper: EMC VNX FAST VP VNX5100, VNX5300, VNX5500, VNX5700, 8 VNX7500 A Detailed ReviewEMC Corporation.
N. Clayton, C. Fuente (2013)
Planning for Easy Tier with IBM System Storage Storwize V7000 and SAN Volume ControllerIBM Corporation.
D. Narayanan, A. Donnelly, A. Rowstron (2008)
Write off-loading: Practical power management for enterprise storageProc, 17
H. Shi, R. V. Arumugam, C. H. Foh, K. K. Khaing (2012)
Optimal disk storage allocation for multi-tier storage systemAsia-Pacific Magnetic Recording Conference (APMRC), 2012
P. E. Dewdney (2013)
SKA1 System Baseline DesignSKA Office.
M. P. van Haarlem, others (2013)
LOFAR: The LOw-Frequency ARrayAstron. Astrophys., 556
J. Guerra, H. Pucha, J. Glider, W. Belluomini, R. Rangaswami (2011)
Cost effective storage using extent based dynamic tieringProc
A. K. Iyengar, M. S. Squillante, L. Zhang (1999)
Analysis and characterization of large-scale web server access patterns and performanceWorld Wide Web, 2
A. Wildani (2013)
The Promise of Data Grouping in Large Scale Storage SystemsPh.D. Dissertation. University of California
J. D. Strunk, E. Thereska, C. Faloutsos, G. R. Ganger (2008)
Using utility to provision storage systemsProc, 21
Y. Kim, A. Gupta, B. Urgaonkar, P. Berman, A. Sivasubramaniam (2011)
HybridStore: A cost-efficient, high-performance storage system combining SSDs and HDDsProc
J. F. C. Kingman (1961)
The single server queue in heavy trafficMath. Proc. Cambridge Philos. Soc., 57
R. L. Graham (1969)
Bounds on multiprocessing timing anomaliesSIAM J. Appl. Math., 17
E. Anderson, S. Spence, R. Swaminathan, M. Kallahalla, Q. Wang (2005)
Quickly finding near-optimal storage designsACM Trans. Comput. Syst., 23
I. Iliadis, J. Jelitto, Y. Kim, S. Sarafijanovic, V. Venkatesan (2015)
ExaPlan: Queueing-based data placement and provisioning for large tiered storage systemsProc
D. Essary, A. Amer (2008)
Predictive data grouping: Defining the bounds of energy and latency reduction through predictive data grouping and replicationTrans. Storage, 4
B. Balcioğlu, D. L. Jagerman, T. Altiok (2008)
Merging and splitting autocorrelated arrival processes and impact on queueing performancePerform. Eval., 65
J. Wolf (1989)
The placement optimization program: A practical solution to the disk file assignment problemSIGMETRICS Perform. Eval. Rev., 17
K. Brandt, D. D. E. Long, A. Amer (2004)
Predicting when not to predictProc
L. Lin, Y. Zhu, J. Yue, Z. Cai, B. Segee (2011)
Hot random off-loading: A hybrid storage system with dynamic data migrationProc
G. Cancio, V. Bahyl, G. Lo Re, S. Murray, E. Cano, G. Lee, V. Kotlyar (2010)
Tape archive challenges when approaching Exabyte-scale(2010). Presentation at CHEP, 2010
B. Dufrasne, R. Wolf (2016)
IBM DS8000 EasyTierAn IBM Redpaper publication (7th ed.). IBM International Technical Support Organization (ITSO) http://www.redbooks.ibm.com/abstracts/ redp4667.html?Open.
N. Hansen, A. Ostermeier (1996)
Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptationProc. of IEEE Int’l Conf. on Evolutionary Computation
Multi-tiered storage, where each tier consists of one type of storage device (e.g., SSD, HDD, or disk arrays), is a commonly used approach to achieve both high performance and cost efficiency in large-scale systems that need to store data with vastly different access characteristics. By aligning the access characteristics of the data, either fixed-sized extents or variable-sized files, to the characteristics of the storage devices, a higher performance can be achieved for any given cost. This article presents ExaPlan, a method to determine both the data-to-tier assignment and the number of devices in each tier that minimize the systems mean response time for a given budget and workload. In contrast to other methods that constrain or minimize the system load, ExaPlan directly minimizes the systems mean response time estimated by a queueing model. Minimizing the mean response time is typically intractable as the resulting optimization problem is both nonconvex and combinatorial in nature. ExaPlan circumvents this intractability by introducing a parameterized data placement approach that makes it a highly scalable method that can be easily applied to exascale systems. Through experiments that use parameters from real-world storage systems, such as CERN and LOFAR, it is demonstrated that ExaPlan provides solutions that yield lower mean response times than previous works. It supports standalone SSDs and HDDs as well as disk arrays as storage tiers, and although it uses a static workload representation, we provide empirical evidence that underlying dynamic workloads have invariant properties that can be deemed static for the purpose of provisioning a storage system. ExaPlan is also effective as a load-balancing tool used for placing data across devices within a tier, resulting in an up to 3.6-fold reduction of response time compared with a traditional load-balancing algorithm, such as the Longest Processing Time heuristic.
ACM Transactions on Storage (TOS) – Association for Computing Machinery
Published: May 22, 2017
Keywords: Tiered storage
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.