Efficient and Scalable Algorithms for Smoothed Particle Hydrodynamics on Hybrid Shared/Distributed-Memory Architectures

@article{Gonnet2014EfficientAS,
  title={Efficient and Scalable Algorithms for Smoothed Particle Hydrodynamics on Hybrid Shared/Distributed-Memory Architectures},
  author={Pedro Gonnet},
  journal={SIAM J. Scientific Computing},
  year={2014},
  volume={37}
}
This paper describes a new fast and implicitly parallel approach to neighbor-finding in multiresolution smoothed particle hydrodynamics (SPH) simulations. This new approach is based on hierarchical cell decompositions and sorted interactions, within a task-based formulation. It is shown to be faster than traditional tree-based codes and to scale better than domain decomposition--based approaches on hybrid shared/distributed-memory parallel architectures, e.g., clusters of multicores, achieving… CONTINUE READING
1
Twitter Mention

Citations

Publications citing this paper.
SHOWING 1-9 OF 9 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 29 REFERENCES

The cosmological simulation code gadget-2

VIEW 14 EXCERPTS
HIGHLY INFLUENTIAL

and J

A. YarKhan, J. Kurzak
  • Dongarra, QUARK Users’ Guide, Electrical Engineering and Computer Science, Innovative Computing Laboratory, University of Tennessee, April
  • 2011
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Data-Driven Execution of Fast Multipole Methods

  • Concurrency and Computation: Practice and Experience
  • 2012
VIEW 1 EXCERPT