Please use this identifier to cite or link to this item: https://doi.org/10.1109/MSST.2012.6232374
Title: HRAID6ML: A hybrid RAID6 storage architecture with mirrored logging
Authors: Zeng, L.
Feng, D.
Chen, J.
Wei, Q.
Veeravalli, B. 
Liu, W.
Issue Date: 2012
Citation: Zeng, L.,Feng, D.,Chen, J.,Wei, Q.,Veeravalli, B.,Liu, W. (2012). HRAID6ML: A hybrid RAID6 storage architecture with mirrored logging. IEEE Symposium on Mass Storage Systems and Technologies : -. ScholarBank@NUS Repository. https://doi.org/10.1109/MSST.2012.6232374
Abstract: The RAID6 provides high reliability using double-parity-update at cost of high write penalty. In this paper, we propose HRAID6ML, a new logging architecture for RAID6 systems for enhanced energy efficiency, performance and reliability. HRAID6ML explores a group of Solid State Drives (SSDs) and Hard Disk Drives (HDDs): Two HDDs (parity disks) and several SSDs form RAID6. The free space of the two parity disks is used as mirrored log region of the whole system to absorb writes. The mirrored logging policy helps to recover system from parity disk failure. Mirrored logging operation does not introduce noticeable performance overhead to the whole system. HRAID6ML eliminates the additional hardware and energy costs, potential single point of failure and performance bottleneck. Furthermore, HRAID6ML prolongs the lifecycle of the SSDs and improves the systems energy efficiency by reducing the SSDs write frequency. We have implemented proposed HRAID6ML. Extensive trace-driven evaluations demonstrate the advantages of the HRAID6ML system over both traditional SSD-based RAID6 system and HDD-based RAID6 system. © 2012 IEEE.
Source Title: IEEE Symposium on Mass Storage Systems and Technologies
URI: http://scholarbank.nus.edu.sg/handle/10635/70490
ISBN: 9781467317450
ISSN: 21601968
DOI: 10.1109/MSST.2012.6232374
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.