Disk array storage system reliability

Burkhard, Walter A.; Menon, Jai

doi:10.1109/ftcs.1993.627346

Cited by 80 publications

(71 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[21,39,2,8,37]. However, none of these models distinguishes the primary disk failures from the backup disk failures, i.e., they assume that all the data on a failure disk can be recovered from its mirror disk.…”

Section: Reliability and Availability Analysismentioning

confidence: 99%

CEFT: A cost-effective, fault-tolerant parallel virtual file system

Zhu

Jiang

2006

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

The vulnerability of computer nodes due to component failures is a critical issue for cluster-based file systems. This paper studies the development and deployment of mirroring in cluster-based parallel virtual file systems to provide fault tolerance and analyzes the tradeoffs between the performance and the reliability in the mirroring scheme. It presents the design and implementation of CEFT, a scalable RAID-10 style file system based on PVFS, and proposes four novel mirroring protocols depending on whether the mirroring operations are server-driven or client-driven, whether they are asynchronous or synchronous. The comparisons of their write performances, measured in a real cluster, and their reliability and availability, obtained through analytical modeling, show that these protocols strike different tradeoffs between the reliability and performance. Protocols with higher peak write performance are less reliable than those with lower peak write performance, and vice versa. A hybrid protocol is proposed to optimize this tradeoff.

show abstract

Section: Reliability and Availability Analysismentioning

confidence: 99%

CEFT: A cost-effective, fault-tolerant parallel virtual file system

Zhu

Jiang

2006

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…And the repair-failure process is a traditional Markov model as shown in Fig. 2 [9]. The role of the silent failure process is to designate the initial state in the repair-failure process after waiting for time t, an execution period of data scrubbing operation.…”

Section: Figmentioning

confidence: 99%

“…Hence, the technical nature and trends in hard disk drives must be understood to build highly reliable storage systems. In previous research [9]- [11], complete disk drive failures were the main focus when analyzing the reliability of storage systems. Thus, the reliability model of storage systems has been based on the assumption that the data is mainly lost due to complete disk drive failures.…”

Section: Introductionmentioning

confidence: 99%

Effects of Data Scrubbing on Reliability in Storage Systems

Ryu

Park

2009

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

Junkil RYU†a) , Nonmember and Chanik PARK †b) , Member SUMMARY Silent data corruptions, which are induced by latent sector errors, phantom writes, DMA parity errors and so on, can be detected by explicitly issuing a read command to a disk controller and comparing the corresponding data with their checksums. Because some of the data stored in a storage system may not be accessed for a long time, there is a high chance of silent data corruption occurring undetected, resulting in data loss. Therefore, periodic checking of the entire data in a storage system, known as data scrubbing, is essential to detect such silent data corruptions in time. The errors detected by data scrubbing will be recovered by the replica or the redundant information maintained to protect against permanent data loss. The longer the period between data scrubbings, the higher the probability of a permanent data loss. This paper proposes a Markov failure and repair model to conservatively analyze the effect of data scrubbing on the reliability of a storage system. We show the relationship between the period of a data scrubbing operation and the number of data replicas to manage the reliability of a storage system by using the proposed model.

show abstract

“…[9]). Therefore, Reed-Solomon (RS) codes have become very popular in distributed storage systems [15,11] and disk arrays [6,14] since they combine a good rate of (n − k)/k with distance d(Y ) = n − k + 1. Unfortunately, as RS codes are MDS codes, they also suffer from an undesired update overhead because if x is modified, all blocks of y must be rewritten, what is dismal in a SAN suffering from expensive I/O accesses.…”

Section: Related Workmentioning

confidence: 99%

Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks

Mense

Schindelhauer

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We introduce the Read-Write-Coding-System (RWC) -a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k ≤ r, w ≤ n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear (n, k, d)-codes that have (a) minimum distance d = n−r+1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r, w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r = k and thus, w = n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data.

show abstract

Disk array storage system reliability

Cited by 80 publications

References 6 publications

CEFT: A cost-effective, fault-tolerant parallel virtual file system

CEFT: A cost-effective, fault-tolerant parallel virtual file system

Effects of Data Scrubbing on Reliability in Storage Systems

Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks

Contact Info

Product

Resources

About