Processing Unstructured Meshes in Multithreaded Environments With the Help of Hilbert Renumbering and Dynamic Scheduling

A software that deals with unstructured meshes is always tedious to parallelize because of its frequent indirect memory writes. These fine grain memory races are usually dealt with costly memory duplication and scatter-gather methods which require strong modifications in both algorithm and data structures. With the help of Hilbert renumbering and clever block dynamic scheduling, concurrent memory writes problems can be addressed at a very low compute and memory overhead. Furthermore, such a scheme always provides a very quick and easy parallelization of existing serial codes. It is, however, limited to shared memory machines but recent development in this area made tens of cores and terabytes of memory affordable, thus pushing the limit to billions of elements.