SplitFS: Reducing software overhead in file systems for persistent memory

R Kadekodi, SK Lee, S Kashyap, T Kim, A Kolli… - Proceedings of the 27th …, 2019 - dl.acm.org
We present SplitFS, a file system for persistent memory (PM) that reduces software overhead
significantly compared to state-of-the-art PM file systems. SplitFS presents a novel split of …

{DupLESS}:{Server-Aided} encryption for deduplicated storage

S Keelveedhi, M Bellare, T Ristenpart - 22nd USENIX security …, 2013 - usenix.org
Cloud storage service providers such as Dropbox, Mozy, and others perform deduplication
to save space by only storing one copy of each file uploaded. Should clients conventionally …

Secure deduplication with efficient and reliable convergent key management

J Li, X Chen, M Li, J Li, PPC Lee… - IEEE transactions on …, 2013 - ieeexplore.ieee.org
Data deduplication is a technique for eliminating duplicate copies of data, and has been
widely used in cloud storage to reduce storage space and upload bandwidth. Promising as it …

A comprehensive study of the past, present, and future of data deduplication

W Xia, H Jiang, D Feng, F Douglis… - Proceedings of the …, 2016 - ieeexplore.ieee.org
Data deduplication, an efficient approach to data reduction, has gained increasing attention
and popularity in large-scale storage systems due to the explosive growth of digital data. It …

A survey and classification of software-defined storage systems

R Macedo, J Paulo, J Pereira, A Bessani - ACM Computing Surveys …, 2020 - dl.acm.org
The exponential growth of digital information is imposing increasing scale and efficiency
demands on modern storage infrastructures. As infrastructure complexity increases, so does …

Deduplication on encrypted big data in cloud

Z Yan, W Ding, X Yu, H Zhu… - IEEE transactions on big …, 2016 - ieeexplore.ieee.org
Cloud computing offers a new way of service provision by re-arranging various resources
over the Internet. The most important and popular cloud service is data storage. In order to …

An optimal algorithm for intersecting line segments in the plane

B Chazelle, H Edelsbrunner - Journal of the ACM (JACM), 1992 - dl.acm.org
The main contribution of this work is an O (n log n+ k)-time algorithm for computing all k
intersections among n line segments in the plane. This time complexity is easily shown to be …

Improving restore speed for backup systems that use inline {Chunk-Based} deduplication

M Lillibridge, K Eshghi, D Bhagwat - 11th USENIX Conference on File …, 2013 - usenix.org
Slow restoration due to chunk fragmentation is a serious problem facing inline chunk-based
data deduplication systems: restore speeds for the most recent backup can drop orders of …

RAIDShield: characterizing, monitoring, and proactively protecting against disk failures

A Ma, R Traylor, F Douglis, M Chamness, G Lu… - ACM Transactions on …, 2015 - dl.acm.org
Modern storage systems orchestrate a group of disks to achieve their performance and
reliability goals. Even though such systems are designed to withstand the failure of …

Design tradeoffs for data deduplication performance in backup workloads

M Fu, D Feng, Y Hua, X He, Z Chen, W Xia… - … USENIX Conference on …, 2015 - usenix.org
Data deduplication has become a standard component in modern backup systems. In order
to understand the fundamental tradeoffs in each of its design choices (such as prefetching …