{'fraction_non_alphanumeric': 0.02226179875333927, 'fraction_numerical': 0.0, 'mean_word_length': 5.108695652173913, '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}}
Enhanced Schedulability via Minimal Routing with Mapping and Priority Assignment for Real-Time Network-on-chip

Multi-processor System-on-Chip (MPSoC) based on Networks-On-Chip (NoC) as a communication paradigm becoming an industry standard in design of embedded system. Some class of embedded systems are designed for executing real-time services which are having stringent deadlines, failing to meet these deadlines may lead to catastrophic failure. NoC not only requires specialized architecture to deal with real time requirement but also problem of task mapping and flow priority assignment becomes more crucial. Real-time schedulability analysis is performed assuming worst-case to get the lower bound of schedulability for tasks and flows. The term schedulability defines the number of tasks and flows meeting the deadlines. Flow of data packets from source to destination node depends on the network topology of NoC and routing strategy at the routers. It improves on end to end schedulability by considering all possible minimal paths on place of fixed X-Y routing. It also considers deadlock avoidance in routing.