{'fraction_non_alphanumeric': 0.027102803738317756, 'fraction_numerical': 0.0, 'mean_word_length': 5.490909090909091, '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}}
Federated Scheduling in Clustered Many-core Processors

High-performance embedded systems, such as self-driving systems require platforms that reduce power consumption and perform high-performance processing. As satisfying both requirements, multi-tmany-core processors are attracting attention. This paper focuses on a clustered many-core processors represented by Kalray MPPA. Clustered many-core processors regard multiple cores as a single cluster, with each cluster having private memory. A bus within each cluster performs communication. A network-on-chip (NoC) is used between clusters. These two communication speeds are different. However, it is inappropriate to always assume that the worst calculation is the slow NoC communication speed. This paper discusses a method to improve worst-case communication time estimation when applying federated scheduling on clustered many-core processors with routes at a different speed. Furthermore, this paper investigates an approach to assign dedicated cores in multiple clusters to reduce the number of required cores.