A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient parity placement schemes for tolerating up to two disk failures in disk arrays
2000
Journal of systems architecture
Preserved Fulltext
Both DH schemes can tolerate up to two disk failures by using two types of parity information placed in the diagonal and the horizontal directions, respectively, in a matrix of disk partitions. ...
In order to achieve high reliability in disk array systems, two new schemes using dual parity placement, called DH1 (diagonal±horizontal) and DH2 schemes, are presented. ...
Conclusion In this paper, two ecient parity placement schemes, called DH1 and DH2 schemes, are presented for tolerating up to two disk failures. ...
doi:10.1016/s1383-7621(00)00031-x
fatcat:7bcbsb6wpnbylm7xdqhctuv6gy
Balanced RM2: An Improved Data Placement Scheme for Tolerating Double Disk Failures in Disk Arrays
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In order to meet these requirements, an efficient data placement scheme called RM2 has been proposed in [1], which enables a disk array system to tolerate double disk failures. ...
However, RM2 has high data reconstruction overhead due to data dependency between parity groups in the case of double disk failures, suffering from large performance fluctuation according to disk failure ...
Currently, we are considering the data and parity placement schemes to tolerate n disk failures in disk arrays. ...
doi:10.1007/978-3-540-24688-6_50
fatcat:3taerb3bybdijj3q3dl774xtoa
Parity logging overcoming the small write problem in redundant disk arrays
1993
SIGARCH Computer Architecture News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Parity logging provides performance competitive with mirroring, the best of the alternative single failure tolerating disk array organizations. ...
This paper presents parity logging, a novel solution to the small write problem for redundant disk arrays. ...
Section 9: Acknowledgments We would like to thank Ed Lee for the original version of Raidsim, and Brian Bershad, Peter Chen, Hugo Patterson, and Jody Prival for early reviews. ...
doi:10.1145/173682.165143
fatcat:kwzcc7k4p5csvnv7qaxrfdtqb4
Parity Logging Overcoming the Small Write Problem in Redundant Disk Arrays
[chapter]
2009
High Performance Mass Storage and Parallel I/O
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Parity logging provides performance competitive with mirroring, the best of the alternative single failure tolerating disk array organizations. ...
This paper presents parity logging, a novel solution to the small write problem for redundant disk arrays. ...
Section 9: Acknowledgments We would like to thank Ed Lee for the original version of Raidsim, and Brian Bershad, Peter Chen, Hugo Patterson, and Jody Prival for early reviews. ...
doi:10.1109/9780470544839.ch5
fatcat:m5rupf3runexrojq4bukwmpqkq
Parity logging overcoming the small write problem in redundant disk arrays
1993
Proceedings of the 20th annual international symposium on Computer architecture - ISCA '93
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Parity logging provides performance competitive with mirroring, the best of the alternative single failure tolerating disk array organizations. ...
This paper presents parity logging, a novel solution to the small write problem for redundant disk arrays. ...
Section 9: Acknowledgments We would like to thank Ed Lee for the original version of Raidsim, and Brian Bershad, Peter Chen, Hugo Patterson, and Jody Prival for early reviews. ...
doi:10.1145/165123.165143
dblp:conf/isca/StodolskyGH93
fatcat:5cbi4joiz5hv7doug26czq5fru
Failure recovery algorithms for multimedia servers
2000
Multimedia Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present two novel disk failure recovery methods that utilize the inherent characteristics of video streams for efficient recovery. ...
We present an inherently redundant array of disks (IRAD) architecture that combines these loss-resilient compression algorithms with techniques for efficient placement of video streams on disk arrays to ...
By integrating these schemes with placement techniques, we derive a new disk array architecture for storing video streams. ...
doi:10.1007/s005300050001
fatcat:5jzptez52rgp7pi3y2njaadn3e
P-Code
2009
Proceedings of the 23rd international conference on Conference on Supercomputing - ICS '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
RAID-6 significantly outperforms the other RAID levels in disk-failure tolerance due to its ability to tolerate arbitrary two concurrent disk failures in a disk array. ...
We propose a row-parity placement strategy for RDP to help it attain optimal update complexity. ...
Acknowledgments We thank the anonymous reviewers for ICS '09 for their helpful comments. We also thank Chu Li, Bo Mao, Suzhen Wu, Lingfang Zeng, and Jianxi Chen for their feedback. ...
doi:10.1145/1542275.1542326
dblp:conf/ics/JinJFT09
fatcat:kxkkm2f76rcbtgjrqczn7zbhpi
Minimization of buffer requirements using variable-size parity groups for fault-tolerant video servers
2003
2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we propose storage allocation schemes to minimize the buffer requirements for fault-tolerant video-ondemand (VOD) servers with disk arrays. ...
For real-time video service, all the blocks in a parity group are prefetched to cope with disk failure. ...
In addition, since large-scale disk arrays are highly vulnerable to disk failures, fault-tolerant mechanisms are needed to support a degraded mode, when a disk fails. ...
doi:10.1109/icme.2003.1221010
dblp:conf/icmcs/SongS03
fatcat:ua2xnssgmrcipnhe6jnaf45c4y
Mirrored and Hybrid Disk Arrays: Organization, Scheduling, Reliability, and Performance
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Basic mirroring (BM) classified as RAID level 1 replicates data on two disks, thus doubling disk access bandwidth for read requests. ...
Hybrid disk arrays which store XORed instead of replicated data tend to have a higher reliability than mirrored disks, but incur a higher overhead in updating data. ...
RAID5 is less reliable than the four RAID1 organizations, since RAID1 arrays can tolerate more than two disk failures up to M = N/2. 2. ...
arXiv:1801.08873v1
fatcat:epbfrk2ukberrnguq25joqyzua
RAID: high-performance, reliable secondary storage
1994
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
It then discusses the two architectural techniques used in disk arrays: striping across multiple disks to improve performance and redundancy to improve reliability. ...
Disk arrays were proposed in the 1980s as a way to use parallelism between multiple disks to improve aggregate I/O performance. ...
One such scheme, called P+Q redundancy, uses Reed-Solomon codes to protect against up to two disk failures using the bare minimum of two redundant disks. ...
doi:10.1145/176979.176981
fatcat:5hb5vw56xrh2zo5cifiihoxlre
Online availability upgrades for parity-based RAIDs through supplementary parity augmentations
2011
ACM Transactions on Storage
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The former, which calculates the supplementary parity of a fixed subset of the disks, can tolerate more disk failures and sector errors; whereas, the latter shifts the coverage of supplementary parity ...
the reconstruction performance while tolerating multiple disk failures and latent sector errors simultaneously. ...
Number of the disks in a disk array 1/λ Mean time to failure for a disk 1/μ 1 Mean time to rebuild for one disk failure 1/μ 2 Mean time to rebuild for two simultaneous disk failureThe upper bound of ...
doi:10.1145/1970338.1970341
fatcat:4kemju36d5hurlgqa4jyi7ps24
Alpha Entanglement Codes: Practical Erasure Codes to Archive Data in Unreliable Environments
2018
2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1810.02974v1 fatcat:76ox5mazmbcfrhewjgxmjgxxce
Most redundancy schemes are not completely effective for providing high availability, durability and integrity in the long-term. ...
Two other parameters increase fault-tolerance even further without the need of additional storage. ...
V.E.G. thanks Jay Lofstead, Ahmed Amer, Kragen Sitaker, and Hugues Mercier for stimulating discussions, and to Luiz Barroso for answering questions regarding availability in global systems. ...
doi:10.1109/dsn.2018.00030
dblp:conf/dsn/Estrada-Galinanes18
fatcat:t6yzk6yionfe7mdekrj2f5xeme
Design of fault-tolerant large-scale VOD servers: With emphasis on high-performance and low-cost
2001
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Thus, in this paper, we present alternative schemes which provide a high degree of reliability at low disk storage, bandwidth, and memory costs for on-demand multimedia servers. ...
Although a single disk is fairly reliable, a large disk farm can have an unacceptably high probability of disk failure. ...
groups; for instance, disk R in Fig. 8 belongs to two different parity groups because it acts as the parity disk for cluster H and as a data disk for cluster I. ...
doi:10.1109/71.920587
fatcat:hlhc6t3u4vcqnf776lunh2tjpu
Protecting against rare event failures in archival systems
2009
2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
This approach handles small-scale failures of one or two devices efficiently while still allowing the system to survive rare-event, larger-scale failures of four or more devices. ...
To protect against rare event failures, reliability stripes are grouped into larger "über-groups," each of which has a corresponding "über-parity;"über-parity is only used to recover data when disk failures ...
Acknowledgments We would like to thank our colleagues in the Storage Systems Research Center (SSRC) who provided valuable feedback for this paper. ...
doi:10.1109/mascot.2009.5366825
dblp:conf/mascots/WildaniSML09
fatcat:3j5cedxckzenznsb5hnu7adnna
Shifted declustering
2008
Proceedings of the 22nd annual international conference on Supercomputing - ICS '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We retrofit the desirable properties of optimal parallelism in parity architectures for replication architectures, and propose a novel placement-ideal data layout -shifted declustering for replication ...
, chained declustering, group rotational declustering and existing parity layout schemes PRIME and RELPR in reference [4] . ...
For example, Holland and Gibson [11] solve the placement-ideal layout problem to tolerate one disk failure. Alvarez et al. ...
doi:10.1145/1375527.1375549
dblp:conf/ics/ZhuGW08
fatcat:cpmzx2f7lvehfphhm2q2qmkcxe
« Previous
Showing results 1 — 15 out of 476 results