Parity-Switched Data Placement: Optimizing Partial Stripe Writes in XOR-Coded Storage Systems
Authors:
- 4 February 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 27 (11) , 3311-3322
Abstract
Erasure codes tolerate disk failures by pre-storing a low degree of data redundancy, and have been commonly adopted in current storage systems. However, the attached requirement on data consistency exaggerates partial stripe write operations and thus seriously downgrades system performance. Previous works to optimize partial stripe writes are relatively limited, and a general mechanism is still absent. In this paper, we propose a Parity-Switched Data Placement (PDP) to optimize partial stripe writes for any XOR-coded storage system. PDP first reduces the write operations by arranging continuous data elements to join a common parity element's generation. To achieve a deeper optimization, PDP further explores the generation orders of parity elements and makes any two continuous data elements associate with a common parity element. Intensive evaluations show that for tested erasure codes, PDP reduces up to 31.9 percent of write operations and further increases the write speed by up to 59.8 percent when compared with two state-of-the-art data placement methods.Keywords
Funding Information
- National Natural Science Foundation of China (61232003, 61327902)
- Key Laboratory of High-end Server and Storage Technology (2014HSSA02)
This publication has 25 references indexed in Scilit:
- D-Code: An Efficient RAID-6 Code to Optimize I/O Loads and Read Performance2015
- CaCo: An Efficient Cauchy Coding Approach for Cloud Storage SystemsIEEE Transactions on Computers, 2015
- Sector-Disk (SD) Erasure Codes for Mixed Failure Modes in RAID SystemsACM Transactions on Storage, 2014
- On the speedup of single-disk failure recovery in XOR-coded storage systems: Theory and practice2012
- P-Code2009
- STAR : An Efficient Coding Scheme for Correcting Triple Storage Node FailuresIEEE Transactions on Computers, 2008
- Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently2007
- X-code: MDS array codes with optimal encodingIEEE Transactions on Information Theory, 1999
- A case for redundant arrays of inexpensive disks (RAID)ACM SIGMOD Record, 1988
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960