The DOI matches its Crossref record; 23 of the 24 references it cites were found in a registry or an index.
Understanding latent sector errors and how to protect against them
Abstract
Latent sector errors (LSEs) refer to the situation where particular sectors on a drive become inaccessible. LSEs are a critical factor in data reliability, since a single LSE can lead to data loss when encountered during RAID reconstruction after a disk failure or in systems without redundancy. LSEs happen at a significant rate in the field [Bairavasundaram et al. 2007], and are expected to grow more frequent with new drive technologies and increasing drive capacities. While two approaches, data scrubbing and intra-disk redundancy, have been proposed to reduce data loss due to LSEs, none of these approaches has been evaluated on real field data. This article makes two contributions. We provide an extended statistical analysis of latent sector errors in the field, specifically from the view point of how to protect against LSEs. In addition to providing interesting insights into LSEs, we hope the results (including parameters for models we fit to the data) will help researchers and practitioners without access to data in driving their simulations or analysis of LSEs. Our second contribution is an evaluation of five different scrubbing policies and five different intra-disk redundancy schemes and their potential in protecting against LSEs. Our study includes schemes and policies that have been suggested before, but have never been evaluated on field data, as well as new policies that we propose based on our analysis of LSEs in the field.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Existing archival storage solutions, such as magnetic tapes and hard disk drives, suffer from limited media lifespans that render them unsuitable for long-term data retention1–3.”
From Laser writing in glass for dense, fast and efficient archival data storage (2026) · cites this paper as [2]
In the citing paper
“Most digital archive systems rely on media that degrade within a few years1–3.”
From Laser writing in glass for dense, fast and efficient archival data storage (2026) · cites this paper as [2]
Citations
Cites
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · ACM SIGMOD Record · doi:10.1145/971701.50214 · Cited by 2,281
McKusick, M. K., Joy, W. N., Leffler, S. J., & Fabry, R. S. (1984) · ACM Transactions on Computer Systems · doi:10.1145/989.990 · Cited by 749
Row-diagonal parity for double disk failure correction
Corbett, P. F., English, B., Goel, A., Grcanac, T., Kleiman, S. L., Leong, J., & Sankar, S. (2004) · File and Storage Technologies · Cited by 556
An analysis of latent sector errors in disk drives
Bairavasundaram, L. N., Goodson, G. R., Pasupathy, S., & Schindler, J. (2007) · Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/1254882.1254917 · Cited by 296
Prabhakaran, V., Bairavasundaram, L. N., Agrawal, N., Gunawi, H. S., Arpaci-Dusseau, A. C., & Arpaci-Dusseau, R. H. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095830 · Cited by 189
WEAVER codes: highly fault tolerant erasure codes for storage systems
Hafner, J. L. (2005) · File and Storage Technologies · doi:10.5555/1251028.1251044 · Cited by 186
Prabhakaran, V., Bairavasundaram, L. N., Agrawal, N., Gunawi, H. S., Arpaci-Dusseau, A. C., & Arpaci-Dusseau, R. H. (2005) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/1095810.1095830 · Cited by 177
A fresh look at the reliability of long-term digital storage
Baker, M., Shah, M., Rosenthal, D. S. H., Roussopoulos, M., Maniatis, P., Giuli, T., & Bungale, P. (2006) · Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 · doi:10.1145/1217935.1217957 · Cited by 162
Plank, J. S. (2008) · File and Storage Technologies · Cited by 148
EVENODD: an optimal scheme for tolerating double disk failures in RAID architectures
Blaum, M., Brady, J., Bruck, J., & Menon, J. (1994) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/191995.192033 · Cited by 144
Research works printed but not linked: 1
- }} Oprea , A. and Juels , A . 2010. A clean-slate look at disk scrubbing . In Proceeding of FAST'10 . }}Oprea, A. and Juels, A. 2010. A clean-slate look at disk scrubbing. In Proceeding of FAST'10.
Cited by
Remote data checking for network coding-based distributed storage systems
Chen, B., Curtmola, R., Ateniese, G., & Burns, R. (2010) · Proceedings of the 2010 ACM workshop on Cloud computing security workshop · doi:10.1145/1866835.1866842 · Cited by 178
Making Disk Failure Predictions SMARTer
Lu, S., Luo, B., Patel, T., Yao, Y., Tiwari, D., & Shi, W. (2020) · File and Storage Technologies · Cited by 143
The tail at store: a revelation from millions of hours of disk and SSD deployments
Hao, M., Soundararajan, G., Kenchammana-Hosekote, D. R., Chien, A. A., & Gunawi, H. S. (2016) · File and Storage Technologies · Cited by 128
Failure Analysis of Virtual and Physical Machines: Patterns, Causes and Characteristics
Birke, R., Giurgiu, I., Chen, L. Y., Wiesmann, D., & Engbersen, T. (2014) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2014.18 · Cited by 113
Gamma-Pareto Distribution and Its Applications
Alzaatreh, A., Famoye, F., & Lee, C. (2012) · Journal of Modern Applied Statistical Methods · doi:10.22237/jmasm/1335845160 · Cited by 111
Metadata
- Authors
- Schroeder, B., Damouras, S., & Gill, P.
- Affiliations
- University of Toronto (CA)
- Venue
- ACM Transactions on Storage
- Published
- 2010-09
- Volume
- 6
- Issue
- 3
- Pages
- 1-23
- ISSN
- 1553-3077 (ISSN-L)
- 1553-3093
- OpenAlex
- W2138872609
- Cited by
- 131
- References
- 24
- Citations by year
- 2026: 4 · 2025: 2 · 2024: 7 · 2023: 4 · 2022: 6 · 2021: 8 · 2020: 8 · 2019: 9 · 2018: 9 · 2017: 9 · 2016: 4 · 2015: 9 · 2014: 15 · 2013: 7 · 2012: 14
- FWCI
- 16.44
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- ACM Transactions on Storage (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance
- Physical Sciences › Engineering › Safety, Risk, Reliability and Quality › Reliability and Maintenance Optimization
- Keywords
- hard disk drives, data reliability, data cleaning, data loss, field data analysis
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Understanding latent sector errors and how to protect against them. https://app.cochat.ai/papers/10.1145/1837915.1837917
- The paper
- Schroeder, B., Damouras, S., & Gill, P. (2010). Understanding latent sector errors and how to protect against them. ACM Transactions on Storage. https://doi.org/10.1145/1837915.1837917
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.