{'fraction_non_alphanumeric': 0.022701475595913734, 'fraction_numerical': 0.01021566401816118, 'mean_word_length': 4.802631578947368, '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}}
Towards Efficient Simulation of Task Based Parallel Applications

For computer architects and software developers, simulation is an indispensable tool for evaluating new designs and ideas. Unfortunately, it is significantly slower to simulate a parallel environment than to work on real hardware. In this work, we take a first step towards efficient simulation of Task Based Parallel (TBP) applications. Our key idea is that the number of completed tasks can be used as a work-related progress metric to sample these applications. Using this metric, we show that the complete execution of TBP programs can be accurately represented by simulating only a few samples. In fact, our TBP applications only need 5 samples on average to get a mean error below 5 %. In our experiments, when sampling at 1000 completed tasks, 5 samples correspond to 0.5 % of the total execution on average.