{'fraction_non_alphanumeric': 0.021653543307086614, 'fraction_numerical': 0.005905511811023622, 'mean_word_length': 4.784090909090909, '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}}
An efficient approach for memory repair by reducing the number of spares

In this paper, we proposed an approach to reduce the hardware required by the conventional algorithm CRESTA (Comprehensive Real-time Exhaustive Search Test and Analysis) by trying to share the hardware between different sub-analyzers. Experiments with synthesis for the case of three spare rows and three spare columns evidenced for saving at least 15% of hardware, and for the case of two spare rows and two spare columns - about 7%.