By Topic

Parity declustering data layout for tolerating dependent disk failures in network RAID systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wang Gang ; Dept. of Comput. Sci., Nankai Univ., Tianjin, China ; Liu Xiao-Guang ; Liu Jing

In this paper, we present a new data layout - "string parity declustering data layout". This data layout incorporates advantages of both orthogonal data layout and weighted parity declustering data layout. The simulation results show that, it improves the reliability of RAID systems (especially network RAID systems) greatly.

Published in:

Algorithms and Architectures for Parallel Processing, 2002. Proceedings. Fifth International Conference on

Date of Conference:

23-25 Oct. 2002