{'fraction_non_alphanumeric': 0.013528748590755355, 'fraction_numerical': 0.0033821871476888386, 'mean_word_length': 5.8307692307692305, '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}}
A Generic Executable Model for Fast Yet Accurate Contention Simulation in Multiprocessor Systems

With an ever-increasing complexity of hardware/software architectures, system-level simulation is intensively used to address the need for early performance evaluation. In this letter, we introduce a generic executable model that provides fast system simulation with preserved accuracy about shared resource usage. The proposed executable model involves a limited number of simulation events by using instantaneous computation and retroactive correction methods of synchronization instants among applications’ processes. We evaluated our approach on applications with various numbers of tasks and different levels of contention at shared resources. Our observations show that we can achieve the same accuracy with an average speedup of 2.53 compared to the traditional simulation approach.