| dc.description.abstract | In this study we investigate the performance of two cell-grid discretization schemes for a smoothed-particle hydrodynamics (SPH) proxy application that is applied to the two-dimensional dam-break problem. The Cell+Table method uses persistent hash tables to implement grid cells. The Cell+List method uses volatile linked lists. We find that the Cell+Table outperforms the Cell+List method with a performance increase of more than 24 % and 30 % for two different test cases, respectively. We also model the SPH application using machine metrics derived from synthetic benchmarks, and find that both the computational cost and communication cost can be described according to a linear relationship. Furthermore, using the Roofline model to classify the SPH application, we find that it is memory bound which makes it suitable for subdomain discretization schemes that minimize memory traffic. We also provide a suite of benchmarking programs to measure peak FLOPS, system bandwidth, and inter-process communication cost. | |