Creative Commons Attribution 4.0 International license
The paper titled "Avoiding the Disk Bottleneck in the Data Domain Deduplication File System" [Zhu et al., 2008] describes several fundamental ideas behind the file system that drives Data Domain’s deduplication storage products. Initially submitted to the 2007 ACM SIGOPS Symposium on Operating System Principles (SOSP), the paper was rejected by its program committee. It was subsequently submitted and accepted for publication at the USENIX Conference on File And Storage Technologies (FAST) in 2008. Twelve years later, it was honored with the USENIX Test-of-Time Award. This retrospective explores the paper’s historical significance and impact, analyzes the reasons behind its initial rejection, and suggests methods to enhance the paper review process in the academic community.
@InProceedings{li:LIPIcs.FUN.2024.33,
author = {Li, Kai},
title = {{Retrospective: Avoiding the Disk Bottleneck in the Data Domain Deduplication File System}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {33:1--33:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.33},
URN = {urn:nbn:de:0030-drops-199417},
doi = {10.4230/LIPIcs.FUN.2024.33},
annote = {Keywords: Deduplication, file systems, compression}
}