On the public citation graph
Coding techniques for handling failures in large disk arrays
0 signed · 147 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/9780470316511openalex-snapshot
Simulation and the Monte Carlo Method
inferredcites →https://doi.org/10.1002/9781118631980openalex-snapshot
Simulation and the Monte Carlo Method
inferredcites →https://doi.org/10.1006/jpdc.1993.1002openalex-snapshot
Designing Disk Arrays for High Data Reliability
inferredcites →https://doi.org/10.1007/978-3-642-69419-6_10openalex-snapshot
Database Machines: An Idea Whose Time has Passed? A Critique of the Future of Database Machines
inferredcites →https://doi.org/10.1007/bf01185211openalex-snapshot
String layouts for a redundant array of inexpensive disks
inferredcites →https://doi.org/10.1016/0012-365x(75)90040-0openalex-snapshot
Balanced incomplete block designs and related designs
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1080/00401706.1961.10489978openalex-snapshot
Error Correcting Codes
inferredcites →https://doi.org/10.1109/20.45315openalex-snapshot
Data storage in 2000-trends in data storage technologies
inferredcites →https://doi.org/10.1109/mc.1985.1662949openalex-snapshot
Information Storage Technology A Look at the Future
inferredcites →https://doi.org/10.1109/proc.1986.13680openalex-snapshot
Microprocessor technology trends
inferredcites →https://doi.org/10.1112/blms/19.3.273bopenalex-snapshot
COMBINATORICS Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability
inferredcites →https://doi.org/10.1126/science.228.4698.462openalex-snapshot
Multis: A New Class of Multiprocessor Computers
inferredcites →https://doi.org/10.1145/143365.143383openalex-snapshot
Parity declustering for continuous operation in redundant disk arrays
inferredcites →https://doi.org/10.1145/29264.1057632openalex-snapshot
Book review: Combinatorics, Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability by B. Bollobas (Cambridge University Press)
inferredcites →https://doi.org/10.1145/62044.62050openalex-snapshot
Efficient dispersal of information for security, load balancing, and fault tolerance
inferredcites →https://doi.org/10.1145/66451.66457openalex-snapshot
The future of high performance computers in science and engineering
inferredcites →https://doi.org/10.1145/971701.50214openalex-snapshot
A case for redundant arrays of inexpensive disks (RAID)
inferredcites →https://doi.org/10.1214/aoms/1177705047openalex-snapshot
The Existence and Construction of Balanced Incomplete Block Designs
inferredcites →https://doi.org/10.6084/m9.figshare.27043420openalex-snapshot
Why Do Computers Stop and What Can Be Done About It?
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10719839_10openalex-snapshot
Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays
inferred← citeshttps://doi.org/10.1007/10719839_11openalex-snapshot
Rank Inequalities for Packing Designs and Sparse Triple Systems
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_48openalex-snapshot
Cluttered Orderings for the Complete Graph
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_35openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_10openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_10openalex-snapshot
External Memory Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4899-1298-5_37openalex-snapshot
An Adaptive Information Dispersal Algorithm for Time-Critical Reliable Communication
inferred← citeshttps://doi.org/10.1007/978-3-540-24618-3_8openalex-snapshot
Algorithms for Scalable Storage Servers
inferred← citeshttps://doi.org/10.1007/978-3-540-30218-6_17openalex-snapshot
Providing Efficient I/O Redundancy in MPI Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-72434-6_51openalex-snapshot
Towards the Application of Distributed Database in University MIS
inferred← citeshttps://doi.org/10.1007/bf01185207openalex-snapshot
Algorithms for parallel memory, I: Two-level memories
inferred← citeshttps://doi.org/10.1007/bf01185211openalex-snapshot
String layouts for a redundant array of inexpensive disks
inferred← citeshttps://doi.org/10.1007/s10623-014-9920-1openalex-snapshot
On small line sets with few odd-points
inferred← citeshttps://doi.org/10.1007/s11767-010-0311-yopenalex-snapshot
A cascading Latin scheme to tolerate double disk failures in raid architectures
inferred← citeshttps://doi.org/10.1016/b978-0-32-390796-5.00015-2openalex-snapshot
Coding for multiple disk failures
inferred← citeshttps://doi.org/10.1016/j.dam.2004.02.005openalex-snapshot
Erasure-resilient codes from affine spaces
inferred← citeshttps://doi.org/10.1016/j.dam.2005.06.005openalex-snapshot
Cluttered orderings for the complete bipartite graph
inferred← citeshttps://doi.org/10.1016/j.jda.2006.03.003openalex-snapshot
Failed disk recovery in double erasure RAID arrays
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00268-3openalex-snapshot
Ladder orderings of pairs and RAID performance
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00228-0openalex-snapshot
Asymptotically optimal erasure-resilient codes for large disk arrays
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00011-2openalex-snapshot
Evaluating approximately balanced parity-declustered data layouts for disk arrays
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00015-xopenalex-snapshot
Simple randomized mergesort on parallel disks
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00634-5openalex-snapshot
Optimal and pessimal orderings of Steiner triple systems in disk arrays
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00648-5openalex-snapshot
Rank inequalities and separation algorithms for packing designs and sparse triple systems
inferred← citeshttps://doi.org/10.1016/s1383-7621(00)00031-xopenalex-snapshot
Efficient parity placement schemes for tolerating up to two disk failures in disk arrays
inferred← citeshttps://doi.org/10.1109/12.364531openalex-snapshot
EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
inferred← citeshttps://doi.org/10.1109/18.179343openalex-snapshot
New array codes for multiple phased burst correction
inferred← citeshttps://doi.org/10.1109/18.485722openalex-snapshot
MDS array codes with independent parity symbols
inferred← citeshttps://doi.org/10.1109/71.476189openalex-snapshot
Efficient placement of parity and data to tolerate two disk failures in disk array systems
inferred← citeshttps://doi.org/10.1109/9780470544839.ch5openalex-snapshot
Parity Logging Overcoming the Small Write Problem in Redundant Disk Arrays
inferred← citeshttps://doi.org/10.1109/access.2020.3033024openalex-snapshot
Erasure Coding-Oriented Data Update for Cloud Storage: A Survey
inferred← citeshttps://doi.org/10.1109/ccgrid.2007.93openalex-snapshot
Redundancy Management for P2P Storage
inferred← citeshttps://doi.org/10.1109/cscita55725.2023.10104897openalex-snapshot
Reliability Stripe Coagulation in Two Failure Tolerant Storage Arrays
inferred← citeshttps://doi.org/10.1109/dft.2006.42openalex-snapshot
Low-Density Triple-Erasure Correcting Codes for Dependable Distributed Storage Systems
inferred← citeshttps://doi.org/10.1109/dft.2007.26openalex-snapshot
Reconstruction of Erasure Correcting Codes for Dependable Distributed Storage System without Spare Disks
inferred← citeshttps://doi.org/10.1109/dsn.2018.00030openalex-snapshot
Alpha Entanglement Codes: Practical Erasure Codes to Archive Data in Unreliable Environments
inferred← citeshttps://doi.org/10.1109/edcc-c66476.2025.00023openalex-snapshot
Compact Two-Dimensional RAID Level 6 Arrays Tolerating Quadruple Node Failures: Extended Abstract
inferred← citeshttps://doi.org/10.1109/hpcc.2010.28openalex-snapshot
A Flexible and Cost-Effective File-Wise Reliability Scheme for Storage Systems
inferred← citeshttps://doi.org/10.1109/hpdc.2004.12openalex-snapshot
Evaluation of distributed recovery in large-scale storage systems
inferred← citeshttps://doi.org/10.1109/hpdc.2004.1323523openalex-snapshot
Evaluation of distributed recovery in large-scale storage systems
inferred← citeshttps://doi.org/10.1109/i-span.2009.95openalex-snapshot
Reliability Analysis for Full-2 Code
inferred← citeshttps://doi.org/10.1109/icapp.2002.1173578openalex-snapshot
A research on multi-level networked RAID based on cluster architecture
inferred← citeshttps://doi.org/10.1109/icc.1992.268104openalex-snapshot
A coding technique for recovery against double disk failures in disk arrays
inferred← citeshttps://doi.org/10.1109/iccnc.2012.6167474openalex-snapshot
Low-redundancy two-dimensional RAID arrays
inferred← citeshttps://doi.org/10.1109/icdcs.2006.80openalex-snapshot
Store, Forget, and Check: Using Algebraic Signatures to Check Remotely Administered Storage
inferred← citeshttps://doi.org/10.1109/icde.1997.582023openalex-snapshot
Pinwheel scheduling for fault-tolerant broadcast disks in real-time database systems
inferred← citeshttps://doi.org/10.1109/icecet52533.2021.9698416openalex-snapshot
Three-dimensional RAID Arrays with Fast Repairs
inferred← citeshttps://doi.org/10.1109/icpads.2007.4447715openalex-snapshot
Constructing double- and triple-erasure-correcting codes with high availability using mirroring and parity approaches
inferred← citeshttps://doi.org/10.1109/icpads.2008.55openalex-snapshot
Constructing Double-Erasure HoVer Codes Using Latin Squares
inferred← citeshttps://doi.org/10.1109/infcom.2001.916250openalex-snapshot
Integrated error management for media-on-demand services
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639663openalex-snapshot
Construction of efficient OR-based deletion - tolerant coding schemes
inferred← citeshttps://doi.org/10.1109/isca.1994.288145openalex-snapshot
EVENODD: an optimal scheme for tolerating double disk failures in RAID architectures
inferred← citeshttps://doi.org/10.1109/isit.1994.395123openalex-snapshot
Binary codes with large symbols
inferred← citeshttps://doi.org/10.1109/isit.2006.261569openalex-snapshot
A Family of MDS Array Codes with Minimal Number of Encoding Operations
inferred← citeshttps://doi.org/10.1109/jsac.2010.100218openalex-snapshot
T-Code: 3-Erasure Longest Lowest-Density MDS Codes
inferred← citeshttps://doi.org/10.1109/mascot.2004.1348296openalex-snapshot
Disk scrubbing in large archival storage systems
inferred← citeshttps://doi.org/10.1109/mascot.2008.4770553openalex-snapshot
Increased Reliability with SSPiRAL Data Layouts
inferred← citeshttps://doi.org/10.1109/mascots.2013.45openalex-snapshot
Three-Dimensional Redundancy Codes for Archival Storage
inferred← citeshttps://doi.org/10.1109/mascots.2016.13openalex-snapshot
RESAR: Reliable Storage at Exabyte Scale
inferred← citeshttps://doi.org/10.1109/msst.2013.6558435openalex-snapshot
A flexible simulation tool for estimating data loss risks in storage arrays
inferred← citeshttps://doi.org/10.1109/nca.2006.18openalex-snapshot
Comparison of Redundancy Schemes for Distributed Storage Systems
inferred← citeshttps://doi.org/10.1109/nca.2007.37openalex-snapshot
Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems
inferred← citeshttps://doi.org/10.1109/nca.2008.27openalex-snapshot
Generalizing RDP Codes Using the Combinatorial Method
inferred← citeshttps://doi.org/10.1109/nca.2008.45openalex-snapshot
Flexible Parameterization of XOR based Codes for Distributed Storage
inferred← citeshttps://doi.org/10.1109/pccc.2000.830330openalex-snapshot
Steiner triple systems as multiple erasure correcting codes in large disk arrays
inferred← citeshttps://doi.org/10.1109/pccc.2012.6407774openalex-snapshot
Highly reliable two-dimensional RAID arrays for archival storage
inferred← citeshttps://doi.org/10.1109/pccc.2013.6742767openalex-snapshot
Expander code: A scalable erasure-resilient code to keep up with data growth in distributed storage
inferred← citeshttps://doi.org/10.1109/pccc.2016.7820651openalex-snapshot
Simple data entanglement layouts with high reliability
inferred← citeshttps://doi.org/10.1109/pccc.2017.8280454openalex-snapshot
Using entanglements to increase the reliability of two-dimensional square RAID arrays
inferred← citeshttps://doi.org/10.1109/pdis.1991.183060openalex-snapshot
IDA-based redundant arrays of inexpensive disks
inferred← citeshttps://doi.org/10.1109/pdsw.2010.5668028openalex-snapshot
Self-adjusting two-failure tolerant disk arrays
inferred← citeshttps://doi.org/10.1109/prdc.2007.9openalex-snapshot
Combinatorial Constructions of Multi-erasure-Correcting Codes with Independent Parity Symbols for Storage Systems
inferred← citeshttps://doi.org/10.1109/prdc.2008.33openalex-snapshot
Constructing Liberation Codes Using Latin Squares
inferred← citeshttps://doi.org/10.1109/prdc.2009.36openalex-snapshot
Representing X-Code Using Latin Squares
inferred← citeshttps://doi.org/10.1109/prdc.2013.20openalex-snapshot
Reliability of Disk Arrays with Double Parity
inferred← citeshttps://doi.org/10.1109/prdc.2014.17openalex-snapshot
Protecting RAID Arrays against Unexpectedly High Disk Failure Rates
inferred← citeshttps://doi.org/10.1109/prdc.2015.13openalex-snapshot
Failure Recovery Cost Reduction of Disk Arrays Using Adaptive Erasure Correction Coding and Data Compression
inferred← citeshttps://doi.org/10.1109/prdc.2015.16openalex-snapshot
Combining Low IO-Operations During Data Recovery with Low Parity Overhead in Two-Failure Tolerant Archival Storage Systems
inferred← citeshttps://doi.org/10.1109/rttas.1996.509522openalex-snapshot
AIDA-based real-time fault-tolerant broadcast disks
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366816openalex-snapshot
External-memory computational geometry
inferred← citeshttps://doi.org/10.1109/snapi.2007.20openalex-snapshot
Outshining Mirrors: MTTDL of Fixed-Order Spiral Layouts
inferred← citeshttps://doi.org/10.1109/srdsw.2014.13openalex-snapshot
Adaptive Erasure Correction Coding for Energy Efficient Dependable Storage Systems
inferred← citeshttps://doi.org/10.1109/tc.2007.1041openalex-snapshot
Performance of Two-Disk Failure-Tolerant Disk Arrays
inferred← citeshttps://doi.org/10.1109/tdmr.2021.3077848openalex-snapshot
Reliability Analysis of Storage Systems With Partially Repairable Devices
inferred← citeshttps://doi.org/10.1109/tr.2018.2878503openalex-snapshot
A Reliability Model for Dependent and Distributed MDS Disk Array Units
inferred← citeshttps://doi.org/10.1145/1093382.1093386openalex-snapshot
LH* RS ---a highly-available scalable distributed data structure
inferred← citeshttps://doi.org/10.1145/113379.113382openalex-snapshot
Large-scale sorting in parallel memories (extended abstract)
inferred← citeshttps://doi.org/10.1145/1629075.1629076openalex-snapshot
Higher reliability redundant disk arrays
inferred← citeshttps://doi.org/10.1145/1645953.1646308openalex-snapshot
HDDBrs middleware for implementing highly available distributed databases
inferred← citeshttps://doi.org/10.1145/165231.165247openalex-snapshot
Deterministic distribution sort in shared and distributed memory multiprocessors
inferred← citeshttps://doi.org/10.1145/237502.237512openalex-snapshot
Flexible usage of parity storage space in disk arrays
inferred← citeshttps://doi.org/10.1145/237502.237513openalex-snapshot
Simple randomized mergesort on parallel disks
inferred← citeshttps://doi.org/10.1145/352302.352314openalex-snapshot
Timely and fault-tolerant data access from broadcast disks
inferred← citeshttps://doi.org/10.1145/378580.378650openalex-snapshot
Ordering disks for double erasure codes
inferred← citeshttps://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferred← citeshttps://doi.org/10.1145/68182.68194openalex-snapshot
Failure correction techniques for large disk arrays
inferred← citeshttps://doi.org/10.1145/70082.68194openalex-snapshot
Failure correction techniques for large disk arrays
inferred← citeshttps://doi.org/10.1145/71302.71305openalex-snapshot
A project on high performance I/0 subsystems
inferred← citeshttps://doi.org/10.1561/0400000014openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.1561/9781601981073openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.22215/etd/2007-06653openalex-snapshot
Gray codes, universal cycles and confguration orderings for block designs
inferred← citeshttps://doi.org/10.3929/ethz-b-000313616openalex-snapshot
Enabling Efficient RDMA-based Synchronous Mirroring of Persistent Memory Transactions
inferred← citeshttps://doi.org/10.4236/am.2015.61019openalex-snapshot
Some Sequence of Wrapped Δ-Labellings for the Complete Bipartite Graph
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0611109openalex-snapshot
An approach to RAID-6 based on cyclic groups of a prime order
inferred← citeshttps://doi.org/10.5555/1898699.1898890openalex-snapshot
Construction of efficient OR-based deletion - tolerant coding schemes
inferred← citeshttps://doi.org/10.5815/ijitcs.2015.04.08openalex-snapshot
Delay Scheduling Based Replication Scheme for Hadoop Distributed File System
inferred← citeshttps://doi.org/10.82444/warw.33658753openalex-snapshot
An approach to RAID-6 based on cyclic groups
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.