Last-level cache deduplication

Tian, Yingying; Khan, Samira; Jiménez, Daniel; Loh, Gabriel H.

doi:10.1145/2597652.2597655

Cited by 52 publications

(19 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to these factors, some benchmarks can contain up to 98% of duplicated blocks [14]. Further, it has been shown that if each unique memory value is stored exactly once in the cache, compression ratios beyond 16X can be achieved [15].…”

Section: Opportunities For Compressionmentioning

confidence: 99%

“…[14]) remove redundant values across different blocks of the whole cache, while some techniques (e.g. [29,35,82]) exploit redundancy across different words of a cache block and some other techniques (e.g.…”

Section: Compression Algorithmsmentioning

confidence: 99%

“…Afterwards, the most probable elements are coded with [8, 10, 12, 16, 17, 23, 28, 29, 35, 40, 48-50, 52, 53, 56, 63, 64, 66, 78, 82, 83, 88, 93] Zero-content compression [14,35,41,50,52,57,62,78,81] Frequent value compression (FVC) [35,52,59,60,67,70] Base delta immediate (BDI) compression [16,23,35,48,51,63,83,93,94] LZ and variants [6,7,9,17,19,20,22 [8,12] Compression in GPUs [89,93,94] Use of compiler [9,21,43,44,72,73,93] fewer number of bits than those which are least probable. Thus, Huffman coding uses a variablelength coding scheme.…”

Section: Compression Algorithmsmentioning

confidence: 99%

“…Data deduplication [14] is a technique which eliminates duplicated copies of repeating data and stores the redundant data as references to a single copy in a deduplicated data storage. Thus, deduplication is a specific compression approach.…”

Section: Techniques For Cachementioning

confidence: 99%

See 3 more Smart Citations

A Survey Of Architectural Approaches for Data Compression in Cache and Main Memory Systems

Mittal

Vetter

2016

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

As the number of cores on a chip increase and key applications become even more data-intensive, memory systems in modern processors have to deal with increasingly large amount of data. In face of such challenges, data compression presents as a promising approach to increase effective memory system capacity and also provide performance and energy advantages. This paper presents a survey of techniques for using compression in cache and main memory systems. It also classifies the techniques based on key parameters to highlight their similarities and differences. It discusses compression in CPUs and GPUs, conventional and non-volatile memory (NVM) systems, and 2D and 3D memory systems. We hope that this survey will help the researchers in gaining insight into the potential role of compression approach in memory components of future extreme-scale systems.

show abstract

Section: Opportunities For Compressionmentioning

confidence: 99%

Section: Compression Algorithmsmentioning

confidence: 99%

Section: Compression Algorithmsmentioning

confidence: 99%

Section: Techniques For Cachementioning

confidence: 99%

See 2 more Smart Citations

A Survey Of Architectural Approaches for Data Compression in Cache and Main Memory Systems

Mittal

Vetter

2016

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…On the other hand, there have been an effort deduplicating cache blocks which have the same data in HW [19]. This results in increasing the capacity of caches.…”

Section: Related Workmentioning

confidence: 99%

Deduplicating TLB entries for shared pages

Ahn

2018

IEICE Electron. Express

View full text Add to dashboard Cite

Although the page sharing among different address spaces can effectively reduce the memory footprint, the corresponding address mappings still require their own TLB entries. Consequently, redundant address mappings for the shared pages reside in TLBs. Our goal in this study is to increase the TLB density by deduplicating redundant copies of address mappings into a single mapping. In virtualized servers, the case of hosting the same guest operating systems, the same third-party libraries, and the same application is commonly found. Such environments generate the multiple identical address mappings, virtual to physical address, for shared pages among different virtual machines. We exploit this unique characteristic of the virtual memory layout being analogous in the same execution environment, and explore TLB deduplication, called DeTLB, which merges redundant virtual to physical address mappings of different address spaces into a single TLB entry. To demonstrate the performance impact, we develop a QEMU based trace simulator and evaluate the number of TLB misses by running an Apache Spark ALS and a microbenchmark with the Linux KSM module. The results indicate that DeTLB can effectively reduce the number of TLB misses for both data and instructions.

show abstract

Convergent encryption enabled secure data deduplication algorithm for cloud environment

Ahmad,

Arif,

Ahmad

et al. 2024

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThe exponential growth of data poses a critical challenge for cloud storage systems. Redundant data consumes valuable storage space and increases infrastructure costs. Data deduplication, a technique for eliminating duplicate data copies, offers a promising solution. However, existing deduplication techniques often compromise data security, especially when dealing with encrypted data. This paper proposes a novel approach that merges convergent encryption (CE) with data deduplication. CE leverages user data itself to generate unique encryption keys, enabling secure deduplication on encrypted data. We analyze existing literature on secure data deduplication and categorize various techniques using UML activity diagrams. We then present our proposed CE‐based deduplication system, outlining its functionalities through UML diagrams. This research contributes to the field of secure data storage by proposing a novel and secure deduplication approach. By demonstrating its efficiency and security benefits, this work paves the way for more efficient and secure cloud storage solutions. Finally, we demonstrate the system's effectiveness through a comparative analysis, highlighting its potential to significantly improve storage efficiency while maintaining data security.

show abstract

Last-level cache deduplication

Cited by 52 publications

References 27 publications

A Survey Of Architectural Approaches for Data Compression in Cache and Main Memory Systems

A Survey Of Architectural Approaches for Data Compression in Cache and Main Memory Systems

Deduplicating TLB entries for shared pages

Convergent encryption enabled secure data deduplication algorithm for cloud environment

Contact Info

Product

Resources

About