{'fraction_non_alphanumeric': 0.01066350710900474, 'fraction_numerical': 0.0, 'mean_word_length': 4.868055555555555, '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}}
Optimization of Parallel-DEVS Simulations with Partitioning Techniques

With the emergence of parallel computational infrastructures at low cost, reducing simulation time becomes 
 
again an issue of the research community in modeling and simulation. This paper presents an approach to 
 
improve time of discrete event simulations. For that, the Parallel Discrete EVent System formalism is coupled 
 
to a partitioning method in order to parallelize the graph of models. We will present the graph partitioning 
 
method to realize this cutting and quantify the resulting time savings of parallel implementation. This article 
 
highlights the importance of considering the dynamic of the model when partitioning to improve performances. 
 
Many tests are performed from graphs with different sizes and shapes on several hardware architectures.