Efficient mappings for parity-declustered data layouts

DOI10.1007/3-540-45071-8_27MaRDI QIDQ3082933zbMATH OpenOpenAlexFDO

Authors Eric J. Schwabe, Ian M. Sutherland

Publication date 18 March 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45071-8_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Recommendations

• Efficient data mappings for parity-declustered data layouts
• Optimizing large data transfers in parity-declustered data layouts
• Evaluating approximately balanced parity-declustered data layouts for disk arrays
• Flexible usage of redundancy in disk arrays
• Design and performance analysis of a disk array system

Cited in

(4)

• Evaluating approximately balanced parity-declustered data layouts for disk arrays
• Efficient data mappings for parity-declustered data layouts
• Optimizing large data transfers in parity-declustered data layouts
• scientific article; zbMATH DE number 1955812 (Why is no real title available?)

This page was built for publication: Efficient mappings for parity-declustered data layouts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082933)