{'fraction_non_alphanumeric': 0.016766467065868262, 'fraction_numerical': 0.0023952095808383233, 'mean_word_length': 5.102189781021898, '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}}
New Computational Ordering to Reach High Performance in the Time-domain BEM for the Wave Equation

The time-domain BEM problem for wave equation in acoustics and electromagnetism can be expressed as a sparse linear system composed of multiple interaction/convolution matrices. Solving this problem by using sparse matrix-vector products are inefficient to achieve high Flop-rate. In this presentation we introduce a novel approach based on reordering the interaction matrices. We describe this new algorithm which increases the Flop-rate and takes advantage of the SIMD instructions. We present how it changes the parallelization in both shared and distributed memory. Finally, we demonstrate the performance of our system by studying the sequential Flop-rate and the parallel scalability with an airplane test case and up to 32 nodes.