{'fraction_non_alphanumeric': 0.0225752508361204, 'fraction_numerical': 0.0016722408026755853, 'mean_word_length': 5.3, '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}}
Design of Data Compression Mechanism in Cache Memory of Elbrus Processors

Higher capacity of cache memory increases Hit Rate at the cost of power consumption and die area. Hardware data compression in cache allows increasing its effective capacity without significant negative effects on these characteristics. This work discusses the realization of data compression in L3 cache memory of modern processors with “Elbrus” architecture. One of the most efficient and at the same time fast compression algorithms is BDI (Base-Delta-Immediate) algorithm. Its modification, called BDI*-HL (Base-Delta-Immediate Modified, Half-Line), is selected for implementation. To achieve an increase in effective capacity, the principles of joint placement of compressed cache lines are introduced and implemented. L3 cache memory is modified to correctly work with compressed lines. A testing bench is developed to evaluate the effectiveness of the designed mechanism. The developed solution does not require any significant changes in the structure of cache memory, does not affect the principles of eviction policy and the coherency protocol and does not change values of working frequency and cache die area.