Tradeoffs in Scalable Data Routing for Deduplication Clusters
暂无分享,去创建一个
Kai Li | Wei Dong | Fred Douglis | Philip Shilane | R. Hugo Patterson | Sazzala Reddy | Wei Dong | Kai Li | F. Douglis | Philip Shilane | S. Reddy | Hugo R. Patterson
[1] Aleksey Pesterev,et al. Fast, Inexpensive Content-Addressed Storage in Foundation , 2008, USENIX Annual Technical Conference.
[2] Matthew T. O'Keefe,et al. The Global File System , 1996 .
[3] Mahadev Satyanarayanan,et al. Opportunistic Use of Content Addressable Storage for Distributed File Systems , 2003, USENIX Annual Technical Conference, General Track.
[4] Michael Stonebraker,et al. The Case for Shared Nothing , 1985, HPTS.
[5] Cezary Dubnicki,et al. Bimodal Content Defined Chunking for Backup Streams , 2010, FAST.
[6] Christos T. Karamanolis,et al. Evaluation of Efficient Archival Storage Techniques , 2004, MSST.
[7] Dutch T. Meyer,et al. A study of practical deduplication , 2011, TOS.
[8] Jacob R. Lorch,et al. Farsite: federated, available, and reliable storage for an incompletely trusted environment , 2002, OSDI '02.
[9] Cezary Dubnicki,et al. HydraFS: A High-Throughput File System for the HYDRAstor Content-Addressable Storage System , 2010, FAST.
[10] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[11] Hector Garcia-Molina,et al. Copy detection mechanisms for digital documents , 1995, SIGMOD '95.
[12] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[13] Hong Jiang,et al. DEBAR: A scalable high-performance de-duplication storage system for backup and archiving , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).
[14] Mark Lillibridge,et al. Sparse Indexing: Large Scale, Inline Deduplication Using Sampling and Locality , 2009, FAST.
[15] Brian D. Noble,et al. Proceedings of the 5th Symposium on Operating Systems Design and Implementation Pastiche: Making Backup Cheap and Easy , 2022 .
[16] Michael Dahlin,et al. TAPER: tiered approach for eliminating redundancy in replica synchronization , 2005, FAST'05.
[17] Kai Li,et al. Avoiding the Disk Bottleneck in the Data Domain Deduplication File System , 2008, FAST.
[18] Mary S. Schaeffer,et al. Sarbanes-Oxley Act of 2002 , 2012 .
[19] Fred Douglis,et al. Redundancy Elimination Within Large Collections of Files , 2004, USENIX Annual Technical Conference, General Track.
[20] Sean Quinlan,et al. Venti: A New Approach to Archival Storage , 2002, FAST.
[21] Michal Kaczmarczyk,et al. HYDRAstor: A Scalable Secondary Storage , 2009, FAST.
[22] Robert B. Ross,et al. PVFS: A Parallel File System for Linux Clusters , 2000, Annual Linux Showcase & Conference.
[23] Ian Pratt,et al. Proceedings of the General Track: 2004 USENIX Annual Technical Conference , 2004 .
[24] Udi Manber,et al. Finding Similar Files in a Large File System , 1994, USENIX Winter.
[25] Christopher Chute,et al. The Diverse and Exploding Digital Universe , 2011 .
[26] Mark Lillibridge,et al. Extreme Binning: Scalable, parallel deduplication for chunk-based file backup , 2009, 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems.