{'fraction_non_alphanumeric': 0.014423076923076924, 'fraction_numerical': 0.0, 'mean_word_length': 5.720430107526882, '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}}
Performance Optimization of Multiprocessor Real-Time Applications by Graphs Transformations

Performance optimization of multiprocessor real-time applications is a resource allocation problem know to be NP-complete. A new heuristic optimizing the response time is presented. Graphs models are used to exhibit both the potential parallelism of the algorithm and the available parallelism of the multiprocessor. The heuristic is formalized in terms of successive graphs transformations. Its cost function is based on path calculi applied on execution durations of not only calculations but also inter-processor communications.