ACM Home Page
Please provide us with feedback. Feedback
Multi-level RAID for very large disk arrays
Full text PdfPdf (1.25 MB)
Source ACM SIGMETRICS Performance Evaluation Review archive
Volume 33 ,  Issue 4  (March 2006) table of contents
Design, implementation, and performance of storage systems
SPECIAL ISSUE: Design, implementation, and performance of storage systems table of contents
Pages: 17 - 22  
Year of Publication: 2006
ISSN:0163-5999
Author
Alexander Thomasian  New Jersey Institute of Technology, Newark, NJ
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 94,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1138085.1138091
What is a DOI?

ABSTRACT

Very Large Disk Arrays - VLDAs have been developed to cope with the rapid increase in the volume of data generated requiring ultrareliable storage. Bricks or Storage Nodes - SNs holding a dozen or more disks are cost effective VLDA building blocks, since they cost less than traditional disk arrays. We utilize the Multilevel RAID - MRAID paradigm for protecting both SNs and their disks. Each SN is a k-disk-failure-tolerant kDFT array, while replication or l-node failure tolerance - lNFTs paradigm is applied at the SN level. For example, RAID1(M)/5(N) denotes a RAID1 at the higher level with a degree of replication M and each virtual disk is an SN configured as a RAID5 with N physical disks. We provide the data layout for RAID5/5 and RAID6/5 MRAIDs and give examples of updating data and recovering lost data. The former requires storage transactions to ensure the atomicity of storage updates. We discuss some weaknesses in reliability modeling in RAID5 and give examples of an asymptotic expansion method to compare the reliability of several MRAID organizations. We outline the reliability analysis of Markov chain models of VLDAs and briefly report on conclusions from simulation results. In Conclusions we outline areas for further research.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
M. Blaum, J. Brady, J. Bruck, J. Menon, and A. Vardy. "The EVENODD code and its generalizations", in High Performance Mass Storage and Parallel I/O: Technologies and Applications, H. Jin. T. Cortes, and R. Buyya (editors), Wiley 2002, pp. 187--205.
 
5
J. Chandy and A. L. N. Reddy. "Failure evaluation of disk array organizations", Proc. 13th Int'l Conf. on Distributed Computing Systems - ICDCS, Pittsburgh, PA, May 1993, pp. 319--326.
6
 
7
 
8
 
9
J. Gray. "Storage bricks - Keynote speech", First USENIX Conf. on File and Storage Technologies - FAST'02, Monterey, CA, January 2002.
 
10
J. Gray. "Greetings from a filesystem user", Fourth USENIX_Conf. on File and Storage Technologies - FAST'02, San Francisco, CA, December 2005 (keynote speech).
11
12
 
13
 
14
 
15
16
17
 
18
 
19
K. K. Rao, J. L. Hafner, and R. A. Golding. "Reliability for networked storage nodes", IBM Research Report RJ10358, Almaden Research Center, San Jose, CA, September 2005.
20
 
21
 
22
 
23
 
24
 
25
A. Thomasian. "Access costs in clustered RAID disk arrays", The Computer Journal 48(11): 702--713 (November 2005).
 
26
A. Thomasian and J. Xu. "Reliability and performance of mirrored disk organizations", revised and resubmitted November 2005.
 
27
A. Thomasian. "Shortcut method for reliability comparisons in RAID", The Journal of Systems and Software, revised and resubmitted Fall 2005.
 
28
 
29

Collaborative Colleagues:
Alexander Thomasian: colleagues