RIMAC: Redundancy-based hierarchical I/O cache architecture for energy-efficient, high- performance storage systems Xiaoyu Yao and Jun Wang Computer Architecture.

Slides:



Advertisements
Similar presentations
Disk Arrays COEN 180. Large Storage Systems Collection of disks to store large amount of data. Performance advantage: Each drive can satisfy only so many.
Advertisements

RAID Redundant Arrays of Independent Disks Courtesy of Satya, Fall 99.
A CASE FOR REDUNDANT ARRAYS OF INEXPENSIVE DISKS (RAID) D. A. Patterson, G. A. Gibson, R. H. Katz University of California, Berkeley.
Reducing Energy Consumption of Disk Storage Using Power Aware Cache Management Qingbo Zhu, Francis M. David, Christo F. Deveraj, Zhenmin Li, Yuanyuan Zhou.
Destage Algorithms for Disk Arrays with Nonvolatile Caches IEEE TRANSACTIONS ON COMPUTERS, VOL. 47, NO. 2, JANUARY 1998 Anujan Varma, Member, IEEE, and.
Conserving Disk Energy in Network Servers ACM 17th annual international conference on Supercomputing Presented by Hsu Hao Chen.
The Performance Impact of Kernel Prefetching on Buffer Cache Replacement Algorithms (ACM SIGMETRIC 05 ) ACM International Conference on Measurement & Modeling.
ULC: An Unified Placement and Replacement Protocol in Multi-level Storage Systems Song Jiang and Xiaodong Zhang College of William and Mary.
Write off-loading: Practical power management for enterprise storage D. Narayanan, A. Donnelly, A. Rowstron Microsoft Research, Cambridge, UK.
MASSIVE ARRAYS OF IDLE DISKS FOR STORAGE ARCHIVES D. Colarelli D. Grunwald U. Colorado, Boulder.
Enhanced Availability With RAID CC5493/7493. RAID Redundant Array of Independent Disks RAID is implemented to improve: –IO throughput (speed) and –Availability.
RAID- Redundant Array of Inexpensive Drives. Purpose Provide faster data access and larger storage Provide data redundancy.
1 Conserving Energy in RAID Systems with Conventional Disks Dong Li, Jun Wang Dept. of Computer Science & Engineering University of Nebraska-Lincoln Peter.
R.A.I.D. Copyright © 2005 by James Hug Redundant Array of Independent (or Inexpensive) Disks.
Chapter 3 Presented by: Anupam Mittal.  Data protection: Concept of RAID and its Components Data Protection: RAID - 2.
RAID: HIGH PERFORMANCE, RELIABLE SECONDARY STORAGE P. M. Chen, U. Michigan E. K. Lee, DEC SRC G. A. Gibson, CMU R. H. Katz, U. C. Berkeley D. A. Patterson,
RAID Technology CS350 Computer Organization Section 2 Larkin Young Rob Deaderick Amos Painter Josh Ellis.
Cache Memory By JIA HUANG. "Computer Science has only three ideas: cache, hash, trash.“ - Greg Ganger, CMU.
Lecture 17 I/O Optimization. Disk Organization Tracks: concentric rings around disk surface Sectors: arc of track, minimum unit of transfer Cylinder:
Energy Efficient Prefetching – from models to Implementation 6/19/ Adam Manzanares and Xiao Qin Department of Computer Science and Software Engineering.
Energy Efficient Prefetching with Buffer Disks for Cluster File Systems 6/19/ Adam Manzanares and Xiao Qin Department of Computer Science and Software.
Distributed Parity Cache Table. Motivation Parity updating is a high cost operation  Especially for small write operations Read old data 、 Read Old Parity.
Internet Cache Pollution Attacks and Countermeasures Yan Gao, Leiwen Deng, Aleksandar Kuzmanovic, and Yan Chen Electrical Engineering and Computer Science.
Energy Efficient Web Server Cluster Andrew Krioukov, Sara Alspaugh, Laura Keys, David Culler, Randy Katz.
Agenda Nestle Case (continued) Data Management Chapter 5 Review Chapter 6 Review.
THE HP AUTORAID HIERARCHICAL STORAGE SYSTEM J. Wilkes, R. Golding, C. Staelin T. Sullivan HP Laboratories, Palo Alto, CA.
RAID-x: A New Distributed Disk Array for I/O-Centric Cluster Computing Kai Hwang, Hai Jin, and Roy Ho.
Storage System: RAID Questions answered in this lecture: What is RAID? How does one trade-off between: performance, capacity, and reliability? What is.
Ideas for Cooperative Disk Management with ECOSystem Emily Tennant Mentor: Carla Ellis Duke University.
RAID Ref: Stallings. Introduction The rate in improvement in secondary storage performance has been considerably less than the rate for processors and.
Redundant Array of Independent Disks
Toolbox for Dimensioning Windows Storage Systems Jalil Boukhobza, Claude Timsit 12/09/2006 Versailles Saint Quentin University.
PARAID: The Gear-Shifting Power-Aware RAID Charles Weddle, Mathew Oldham, An-I Andy Wang – Florida State University Peter Reiher – University of California,
RAID REDUNDANT ARRAY OF INEXPENSIVE DISKS. Why RAID?
Exploiting Flash for Energy Efficient Disk Arrays Shimin Chen (Intel Labs) Panos K. Chrysanthis (University of Pittsburgh) Alexandros Labrinidis (University.
Reducing Energy Consumption of Disk Storage Using Power- Aware Cache Management Q. Zhu, F. David, C. Devaraj, Z. Li, Y. Zhou, P. Cao* University of Illinois.
Design and Performance Evaluation of Networked Storage Architectures Xubin He July 25,2002 Dept. of Electrical and Computer Engineering.
Dong Hyuk Woo Nak Hee Seong Hsien-Hsin S. Lee
1 PARAID: A Gear-Shifting Power-Aware RAID Charles Weddle, Mathew Oldham, Jin Qian, An-I Andy Wang – Florida St. University Peter Reiher – University of.
PARAID: A Gear-Shifting Power-Aware RAID Charles Weddle, Mathew Oldham, Jin Qian, An-I Andy Wang – Florida St. University Peter Reiher – University of.
MSN 数学媒体与信息存储 1/27 Zhuo Liu, Fei Wu, Xiao Qin, Changsheng Xie, Jian Zhou, and Jianzong Wang TRACER: A Trace Replay Tool to Evaluate Energy-Efficiency of.
DOE PI Meeting at BNL 1 Lightweight High-performance I/O for Data-intensive Computing Jun Wang Computer Architecture and Storage System Laboratory (CASS)
Lecture 40: Review Session #2 Reminders –Final exam, Thursday 3:10pm Sloan 150 –Course evaluation (Blue Course Evaluation) Access through.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
Power and Energy Conservation Techniques for Disk Array Based Systems Zvika Guz June, 2004.
Improving Disk Throughput in Data-Intensive Servers Enrique V. Carrera and Ricardo Bianchini Department of Computer Science Rutgers University.
1 PARAID: A Gear-Shifting Power-Aware RAID Charles Weddle, Mathew Oldham, Jin Qian, An-I Andy Wang – Florida St. University Peter Reiher – University of.
CERN - IT Department CH-1211 Genève 23 Switzerland t High Availability Databases based on Oracle 10g RAC on Linux WLCG Tier2 Tutorials, CERN,
An Efficient Threading Model to Boost Server Performance Anupam Chanda.
1 CMP-MSI.07 CARES/SNU A Reusability-Aware Cache Memory Sharing Technique for High Performance CMPs with Private Caches Sungjune Youn, Hyunhee Kim and.
Energy Efficient Prefetching and Caching Athanasios E. Papathanasiou and Michael L. Scott. University of Rochester Proceedings of 2004 USENIX Annual Technical.
1 © 2002 hp Introduction to EVA Keith Parris Systems/Software Engineer HP Services Multivendor Systems Engineering Budapest, Hungary 23May 2003 Presentation.
Destage Algorithms for Disk Arrays with Non-Volatile Caches Anujan Varma Quinn Jacobson.
Enhanced Availability With RAID CC5493/7493. RAID Redundant Array of Independent Disks RAID is implemented to improve: –IO throughput (speed) and –Availability.
RAID Technology By: Adarsha A,S 1BY08A03. Overview What is RAID Technology? What is RAID Technology? History of RAID History of RAID Techniques/Methods.
PERGAMUM: REPLACING TAPE WITH ENERGY EFFICIENT, RELIABLE, DISK-BASED ARCHIVAL STORAGE M. W. Storer K. M. Greenan E. L. Miller UCSC K. Vorugant Network.
RAID TECHNOLOGY RASHMI ACHARYA CSE(A) RG NO
1 PARAID: A Gear-Shifting Power-Aware RAID Charles Weddle, Mathew Oldham, Jin Qian, An-I Andy Wang – Florida St. University Peter Reiher – University of.
PARAID: A Gear-Shifting Power-Aware RAID
Parallel-DFTL: A Flash Translation Layer that Exploits Internal Parallelism in Solid State Drives Wei Xie1 , Yong Chen1 and Philip C. Roth2 1. Texas Tech.
RAID Redundant Arrays of Independent Disks
Vladimir Stojanovic & Nicholas Weaver
Memory Management for Scalable Web Data Servers
PARAID: A Gear-Shifting Power-Aware RAID
RAID RAID Mukesh N Tekwani
(Architectural Support for) Semantically-Smart Disk Systems
THE HP AUTORAID HIERARCHICAL STORAGE SYSTEM
Qingbo Zhu, Asim Shankar and Yuanyuan Zhou
RAID RAID Mukesh N Tekwani April 23, 2019
Dong Hyun Kang, Changwoo Min, Young Ik Eom
Presentation transcript:

RIMAC: Redundancy-based hierarchical I/O cache architecture for energy-efficient, high- performance storage systems Xiaoyu Yao and Jun Wang Computer Architecture and Storage System Laboratory (CASS) University of Nebraska - Lincoln

University of Nebraska-Lincoln 2 Big Picture Current energy-efficient storage solutions promising:  Saving energy at the cost of performance  Saving energy by using DRPM disk New RIMAC: Redundancy-based hierarchical I/O cache architecture  Making storage cache aware of redundancy  Solving the performance problem with power aware request transformation

University of Nebraska-Lincoln 3 Outline Background & Motivation  Why?  How does RIMAC differ? RIMAC: Redundancy-based Hierarchical I/O Cache Architecture Evaluation Conclusion

University of Nebraska-Lincoln 4 Energy Issues of Internet Data Center Router Web Servers Application Servers Database Servers … … … SAN … Storage System Interne t 27% of Total Energy* * From WP’ %/Year Switch

University of Nebraska-Lincoln 5 Backend Storage System High performance SCSI disks Small disk array as building block  RAID-1, mirrored disk array  RAID-5, parity disk array Multi-level I/O cache  Large storage cache  Moderate RAID controller cache

University of Nebraska-Lincoln 6 Related Work NameConventional Disk Disk Array Storage Cache Performance Penalty MAID (SC ‘02) YesRAID-0Yes PDC (ICS '04) YesNo Yes FS2 (SOSP’05) YesNo DRPM (ISCA’03) NoRAID-1 RAID-5 No PA/PB (HPCA’04) No Yes Hibernator (SOSP’05) NoRAID-5No

University of Nebraska-Lincoln 7 Motivations Server workload characteristics  Dispersed idle period High performance vs. energy conservation  Long “Passive spin-up” delay in conventional disks (10-15 seconds) Exploiting existing infrastructure to consolidate the short idle period  Internal redundancy in disk array  Multi-level I/O cache

University of Nebraska-Lincoln 8 RIMAC - Redundancy Identifying sources of “passive spin-up”  Non-blocking read  Derivative read due to parity update  Dirty block flushing [Zhu et. al. HPCA’04] Exploiting inherent redundancy to untouched sources of “passive spin-up”  1/N redundancy in RAID-5,  Requests on standby disks are transformed to active disk accesses

University of Nebraska-Lincoln 9 RIMAC - Cooperative Cache Deploying parity exclusive cache  Storage cache: user data  RAID controller cache: parity Leveraging redundancy exploitation in cache  High performance power-aware request transformation in multi-level I/O cache  Larger effective storage cache size with new placement/replacement algorithm

University of Nebraska-Lincoln 10 Sample Scenario – Transformable Read in Cache (TRC) P P P P1 Bottom-Half Up-Half Storage Cache Parity CacheP2P3 XOR 6 45 … Read (addr=6, len=1) FRONT-ENDFRONT-END Response Idle/Active Standby RIMAC Storage System …… Disk1Disk3Disk4Disk2

University of Nebraska-Lincoln 11 Sample Scenario – Transformable Read on Disk (TRD) P P P P1 Bottom-Half Up-Half Storage Cache Parity CacheP2P3 XOR 6 48 … Read (addr=6, len=1) FRONT-ENDFRONT-END Response Idle/Active Standby RIMAC Storage System …… Disk1Disk3Disk4Disk2

University of Nebraska-Lincoln 12 Power-aware Request Transformation Storage Cache Parity Cache Disks Read TRC TRD PU-DA-C PU-CA-C PU-DA-D PU-CA-D Write (PUPA)

University of Nebraska-Lincoln 13 PUPA - Parity Update with Power-Aware Direct Access:  P2’ = 5’ XOR 5 XOR P2 Complementary Access:  P2’ = 5’ XOR 6 XOR 4 P P P P1 Write (addr=5, len=1)

University of Nebraska-Lincoln 14 Cache Placement/Replacement Algorithms Storage Cache  LRU with N-1 constraints  Compatible with MQ, LIRS, ARC algorithm Parity Cache  Parity stripe only  Second chance replacement algorithm

University of Nebraska-Lincoln 15 Evaluation Trace driven simulation  Disksim 2.0  3-state disk power models (IBM 36Z15)  RIMAC front-end, bottom-half and upper-half implementation with 5000 lines of C code Workloads  Cello99 from HP: file server  TPC-D from HP: decision support  SPC-SE from SPC: search engine

University of Nebraska-Lincoln 16 System Performance Cello99TPC-DSPC-SE 30% 20-30%2-6%5-14% Larger cache does improve performance

University of Nebraska-Lincoln 17 Energy Consumption Cello99TPC-DSPC-SE 14-15% 33-34% 15-16% Larger cache may not save more energy

University of Nebraska-Lincoln 18 Effects of Read Policies Cello99-64 MBTPC-D 128 MBSPC-SE 256 MB 33.8% 12.8% 49.5% 10.1% 4.1% 6.9%

University of Nebraska-Lincoln 19 Effects of Power Aware Parity Update Policies Cello99-64 MB TPC-D 128 MB Parity Hit Ratio 83.7% 13.8%

University of Nebraska-Lincoln 20 Anatomy of Energy Consumption Cello99-64 MB

University of Nebraska-Lincoln 21 Conclusions RIMAC: Redundancy based Hierarchical I/O cache architecture with minimum overhead Address an open problem - “passive spin-up” in energy-efficient server storage systems by power-aware request transformation both in caches and on disks Reduce energy cost by up to 33% and improve performance by up to 30%

University of Nebraska-Lincoln 22 Thank you!