The DOI matches its Crossref record; 24 of the 28 references it cites were found in a registry or an index.
Practical scrubbing: Getting to the bad sector at the right time
Abstract
Latent sector errors (LSEs) are a common hard disk failure mode, where disk sectors become inaccessible while the rest of the disk remains unaffected. To protect against LSEs, commercial storage systems use scrubbers: background processes verifying disk data. The efficiency of different scrubbing algorithms in detecting LSEs has been studied in depth; however, no attempts have been made to evaluate or mitigate the impact of scrubbing on application performance. We provide the first known evaluation of the performance impact of different scrubbing policies in implementation, including guidelines on implementing a scrubber. To lessen this impact, we present an approach giving conclusive answers to the questions: when should scrubbing requests be issued, and at what size, to minimize impact and maximize scrubbing throughput for a given workload. Our approach achieves six times more throughput, and up to three orders of magnitude less slowdown than the default Linux I/O scheduler.
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 [1]
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 [1]
Citations
Cites
A new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
Autoregressive Conditional Duration: A New Model for Irregularly Spaced Transaction Data
Engle, R. F., & Russell, J. R. (1998) · Econometrica · doi:10.2307/2999632 · Cited by 1,817
The World’s Technological Capacity to Store, Communicate, and Compute Information
Hilbert, M., & López, P. (2011) · Science · doi:10.1126/science.1200970 · Cited by 1,643
Ruemmler, C., & Wilkes, J. (1993) · USENIX Winter · Cited by 428
Autoregressive Conditional Duration: A New Model for Irregularly Spaced Transaction DataPreprint
Russell, J. R., & Engle, R. F. (1998) · SSRN Electronic Journal · Cited by 337
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
Golding, R. A., Bösch, P., Staelin, C., Sullivan, T., & Wilkes, J. (1995) · USENIX Annual Technical Conference · Cited by 264
Argon: performance insulation for shared storage servers
Wachs, M., Abd-El-Malek, M., Thereska, E., & Ganger, G. R. (2007) · File and Storage Technologies · Cited by 243
Data Analysis and Graphics Using R: An Example-based Approach
Maindonald, J., & Braun, J. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511790935 · Cited by 169
Modelling Irregularly Spaced Financial Data
Hautsch, N. (2004) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-17015-7 · Cited by 152
Research works printed but not linked: 3
- axboe, 2004, Linux block IO - Present and future, Proc of the Ottawa Linux Symposium
- 0, I/O Traces Tools and Analysis Repository
- oprea, 2010, A clean-slate look at disk scrubbing, Proc of USENIX FAST
Cited by
Predicting Node Failures in an Ultra-Large-Scale Cloud Computing Platform: An AIOps Solution
Li, Y., Jiang, Z. M., Li, H., Hassan, A. E., He, C., Huang, R., Zeng, Z., Wang, M., & Chen, P. (2020) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3385187 · Cited by 108
SD Codes: Erasure Codes Designed for How Storage Systems Really Fail
Plank, J. S., Blaum, M., & Hafner, J. L. (n.d.) · Cited by 72
Sector-Disk (SD) Erasure Codes for Mixed Failure Modes in RAID Systems
Plank, J. S., & Blaum, M. (2014) · ACM Transactions on Storage · doi:10.1145/2560013 · Cited by 69
Design Tradeoffs for {SSD} Reliability
Kim, B. S. J., Choi, J., & Min, S. L. (2019) · Seoul National University Open Repository (Seoul National University) · Cited by 62
Project Silica: Towards Sustainable Cloud Archival Storage in Glass
Anderson, P., Aranas, E. B., Assaf, Y., Behrendt, R., Black, R., Caballero, M., Cameron, P., Canakci, B., Carvalho, T. D., Chatzieleftheriou, A., et al. (2023) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/3600006.3613208 · Cited by 30
Metadata
- Authors
- Amvrosiadis, G., Oprea, A., & Schroeder, B.
- Affiliations
- University of Toronto (CA)
- Venue
- IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)
- Publisher
- IEEE
- Published
- 2012-06
- Pages
- 1-12
- ISSN
- 1530-0889 (ISSN-L)
- OpenAlex
- W1998799629
- Cited by
- 20
- References
- 28
- Citations by year
- 2026: 1 · 2024: 2 · 2023: 1 · 2021: 2 · 2020: 3 · 2019: 2 · 2018: 1 · 2017: 2 · 2015: 1 · 2014: 1 · 2013: 4
- FWCI
- 1.61
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International Conference on Dependable Systems & Networks/Proceedings (publishedVersion)
- Funders
- Microsoft Research
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
- Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Keywords
- hard disk drives, I/O scheduling, storage reliability
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: Practical scrubbing: Getting to the bad sector at the right time. https://app.cochat.ai/papers/10.1109/dsn.2012.6263919
- The paper
- Amvrosiadis, G., Oprea, A., & Schroeder, B. (2012). Practical scrubbing: Getting to the bad sector at the right time. IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012). https://doi.org/10.1109/dsn.2012.6263919
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.