Parallel mesh partitioning based on space filling curves

•A SFC-based parallel mesh partitioner has been presented.•The performance of the parallel partitioner has been analyzed in detail using up to 4096 CPUs.•The algorithm is fully scalable and does not present any memory or computational bottleneck.•The partition is independent to the number of processes used to perform it.•A mesh of 30M elements can be partitioned in 5 cents of second using 4096 CPUs. Larger supercomputers allow the simulation of more complex phenomena with increased accuracy. Eventually this requires finer and thus also larger geometric discretizations. In this context, and extrapolating to the Exascale paradigm, meshing operations such as generation, deformation, adaptation/regeneration or partition/load balance, become a critical issue within the simulation workflow. In this paper we focus on mesh partitioning. In particular, we present a fast and scalable geometric partitioner based on Space Filling Curves (SFC), as an alternative to the standard graph partitioning approach. We have avoided any computing or memory bottleneck in the algorithm, while we have imposed that the solution achieved is independent (discounting rounding off errors) of the number of parallel processes used to compute it. The performance of the SFC-based partitioner presented has been demonstrated using up to 4096 CPU-cores in the Blue Waters supercomputer.