ScaFaCoS – Scalable Fast Coulomb Solvers
– Subproject: Parallel Sorting –
Simulation codes for complex particle systems play an important role in many different areas of natural sciences and industrial research. For example, these particle systems can consist of stars in astrophysical simulations, or of atoms or molecules in the field of physical chemistry or biophysics. Calculating the long range interactions between particles in complex particle systems requires efficient solution methods that take advantage of the computational power of modern high scaling parallel environments. The ScaFaCoS project aims at the development and implementation of a parallel software library with efficient solvers for long range interactions that can be employed in different simulation codes.
The joint research project “ScaFaCoS” (official website) is a research activity in the field of “HPC-Software for Scalable Parallel Systems” and is supported by the German Federal Ministry of Education and Research (BMBF) as part of the funding program “IKT 2020 - Research for Innovations”.
As part of the ScaFaCoS project, the Department of Computer Science at the Chemnitz University of Technology develops a software library with parallel sorting algorithms for applications in scientific computing. Parallel sorting methods are an important part of the data redistribution and load balancing mechanisms that are highly required for efficient parallel implementations of particle simulations.
Publications
-
Hofmann, M.: Effiziente parallele Sortier- und Datenumverteilungsverfahren für Partikelsimulationen auf Parallelrechnern mit verteiltem Speicher, TU Chemnitz, Fakultät für Informatik, Doctoral thesis, 2012. online resource available
|
 |
-
Hofmann, M.; Rünger, G.: A Partitioning Algorithm for Parallel Sorting on Distributed Memory Systems. In: IEEE 13th International Conference on High Performance Computing and Communications (HPCC 2011): pp. 402-411. IEEE – ISBN 978-1-4577-1564-8. Banff, Canada, 2011. DOI: 10.1109/HPCC.2011.59 online resource available
|
|
-
Gibbon, P.; Hofmann, M.; Rünger, G.; Speck, R.: Parallel Sorting Algorithms for Optimizing Particle Simulations. In: 2010 IEEE International Conference on Cluster Computing, Workshops and Posters (CLUSTER WORKSHOPS): pp. 1-8. IEEE – ISBN 978-1-4244-8395-2. Heraklion, Crete, Greece, 2010. DOI: 10.1109/CLUSTERWKSP.2010.5613105 online resource available
|
|
-
Hofmann, M.; Rünger, G.: An In-place Algorithm for Irregular All-to-All Communication with Limited Memory. In: Keller, R.; Gabriel, E.; Resch, M.; Dongarra, J. (Eds.): Recent Advances in the Message Passing Interface: 17th European MPI User's Group Meeting (LNCS, vol. 6305): pp. 113-121. Springer – ISBN 978-3-642-15645-8. Stuttgart, Germany, 2010. DOI: 10.1007/978-3-642-15646-5_12 online resource available
|
|
-
Hofmann, M.; Rünger, G.: Fine-grained Data Distribution Operations for Particle Codes. In: Ropo, M.; Westerholm, J.; Dongarra, J. (Eds.): Recent Advances in Parallel Virtual Machine and Message Passing Interface, 16th European PVM/MPI Users Group Meeting (LNCS, vol. 5759): pp. 54-63. Springer – ISBN 978-3-642-03769-6. Espoo, Finnland, 2009. DOI: 10.1007/978-3-642-03770-2_12 online resource available
|
|
Complete list as BibTeX
Copyright Notice
The documents
distributed by this server have been provided by the
contributing authors as a means to ensure timely dissemination of scholarly
and technical work on a noncommercial basis. Copyright and all rights
therein are maintained by the authors or by other copyright holders,
notwithstanding that they have offered their works here electronically.
It is understood that all persons copying this information will adhere to
the terms and constraints invoked by each author's copyright. These works
may not be reposted without the explicit permission of the copyright holder.
