{'fraction_non_alphanumeric': 0.017059301380991064, 'fraction_numerical': 0.002437043054427295, 'mean_word_length': 5.806629834254144, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Enabling Approximate Storage through Lossy Media Data Compression

As compute capabilities continue to scale, memory capacity and bandwidth continue to lag behind. Data compression is an effective approach to improving memory capacity and bandwidth; but prior works have focused primarily on lossless compression and retrieval for data-critical applications. While data integrity is critical to many applications, a growing number of memory-bound applications contain non-critical program data; this property can be exploited to improve memory performance and capacity. In this work, we enable approximate storage to exploit the inherent error resilience of multimedia and other applications, through lossy compression, to improve storage without adversely affecting application functionality. We realize an incidence of approximate storage through modification of the Base-Delta-Immediate algorithm to create a lossy memory compression algorithm. We conclude that approximate storage is an effective and promising technique for improving effective memory capacity and decreasing the energy cost of memory access; results show that memory capacity can be increased by 15% with only 3% loss in image recognition application quality.