A new parallel TreeSPH code
classification
🌌 astro-ph
keywords
codeparalleltree-sphbalancingcheckcinecacomparecray
read the original abstract
In this report we describe a parallel implementation of a Tree-SPH code realized using the SHMEM libraries in the Cray T3E supercomputer at CINECA. We show the result of a 3D test to check the code performances against its scalar version. Finally we compare the load balancing and scalability of the code with PTreeSPH (Dav\'e et al 1997), the only other parallel Tree-SPH code present in the literature.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.