{'fraction_non_alphanumeric': 0.02, 'fraction_numerical': 0.0025, 'mean_word_length': 5.005, '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 a cache hierarchy for LogN and LogN+1 model for multi-level cache system for multi-core processors

After the successful implementation of the dual and quad core processors, the designers are now thinking to place hundreds or even thousand of cores on a single chip. But this practice may lead to many basic and fundamental restrictions like interconnection of cores, memory size and its access patterns, cache design, number of cache levels etc. To overcome the cache related problems for many core processors two new multi-level cache models, LogN and LogN+1, have been proposed. These models are based on binary tree data structure. In this paper two design approaches for defining multi-level cache hierarchy for these two models are discussed. These two approaches are based on use of arithmetic and geometric propagation. After analyzing both these approaches for both LogN and LogN+1 model, the geometric propagation approach found much better for defining cache hierarchy in terms of size, frequency and cost. Also, cache access time for a core in a cache hierarchy designed using geometric propagation found much lesser than a cache hierarchy designed using arithmetic propagation.