{'fraction_non_alphanumeric': 0.026607538802660754, 'fraction_numerical': 0.009608277900960829, 'mean_word_length': 5.541062801932367, '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}}
Evaluation of Cache Compression for Elbrus Processors

Data compression in cache memory allows increasing the effective capacity, which improves the hit rate and only insignificantly affects power consumption and die area. In this paper, the results of the first research on cache compression in processors with Elbrus architecture are presented. Base+Delta (B+Δ) and Base-Delta-Immediate (BΔI) compression algorithms are selected for hardware implementation for their high efficiency and lower decompression latency compared to other algorithms. The modified versions of these algorithms, B+Δ* and BΔI*, which allow to reduce implementation complexity and further shorten the latency, are presented. Additionally, a new set of compression schemes for modified algorithms (labeled as BΔI*-HL algorithm) is proposed to account for width of the interfaces and internal data buses. The algorithms were implemented using Verilog HDL and evaluated on FPGA prototype of Elbrus-8C2 processor and SPEC CPU2000 benchmark suite. The results show that BΔI* demonstrates almost equal of greater compression ration as the original BÄI algorithm while has significantly lower implementation complexity. The algorithm BΔI*-HL is proposed as the most suitable for hardware implementation with average compressed lines share of 24.4% and mean compression ratio of 1.246.