Parallel Load Balanced Particle Simulation with Hierarchical Particle Grouping Strategies

  • Florian Fleissner
  • Peter Eberhard
Part of the IUTAM Bookseries book series (IUTAMBOOK, volume 1)


We introduce a new approach for control based load-balanced particle simulation, applying a recursive domain decomposition scheme that enables a minimization of communication expense and efficient hierarchical parallel neighborhood search, especially optimized for multiuser clusters of workstations with fluctuating processor loads.


Discrete Element Method Multibody System Domain Decomposition Neighborhood Search Collision Detection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. Cundall and O. Strack. A discrete numerical model for granular assemblies. Geotechnique, 29(1):47–65, 1979.CrossRefGoogle Scholar
  2. 2.
    Y. Deng, R. F. Peierls, and C. Riveraz. An adaptive load balancing method for parallel molecular dynamics simulations. Journal of Computational Physics, 161:250–263, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    F. Fleißner and P. Eberhard. Dynamical particle simulation with parallel cacheaware domain decomposition strategies. In Proc. Appl. Math. Mech., 5, 657–658, 2005.CrossRefGoogle Scholar
  4. 4.
    R. Hayashi and S. Horiguchi. Relationships between efficiency of dynamic load balancing and particle concentration for parallel molecular dynamics simulation. In The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2, page 976, 2000.CrossRefGoogle Scholar
  5. 5.
    B. Muth and P. Eberhard. Collision detection for many colliding bodies. In: Schiehlen, W. and Valasek, M. (Ed.): Virtual Nonlinear Multibody Systems, NATO ASI, 1:138–143, 2002.Google Scholar
  6. 6.
    B. Muth, M.K. Müller, P. Eberhard, and S. Luding. Contacts between many bodies. Machine Dynamics Problems, 28(1):101–114, 2004.Google Scholar
  7. 7.
    L. Nyland, J. Prins, R.H. Yun, J. Hermans, H.C. Kum, and L. Wang. Achieving scalable parallel molecular dynamics using dynamic spatial domain decomposition techniques. Journal of Parallel and Distributed Computing, 47(2):125–138, 1997.CrossRefGoogle Scholar
  8. 8.
    Open Systems Lab, Indiana University. LAM/MPI User’s Guide Version 7.1.1, 2004.Google Scholar
  9. 9.
    E. Perkins and J.R. Williams. A fast contact detection algorithm insensitive to object sizes. Engineering Computations, 18(1/2):48–61, 2001.zbMATHCrossRefGoogle Scholar
  10. 10.
    A. Schinner. Fast algorithms for the simulation of polygonal particles. Granular Matter, 2:35–43, 1999.CrossRefGoogle Scholar
  11. 11.
    M.S. Warren and J.K. Salmon. A parallel hashed oct-tree n-body algorithm. In Supercomputing’ 93, pages 12–21, 1993.Google Scholar
  12. 12.
    V. Zhakhovskii, K. Nishihara, Y. Fukuda, and S. Shimojo. A new dynamical domain decomposition method for parallel molecular dynamics simulation on grid. Annual progress report, Institute of Laser Engineering, Osaka University, 2004.Google Scholar

Copyright information

© Springer 2007

Authors and Affiliations

  • Florian Fleissner
    • 1
  • Peter Eberhard
    • 1
  1. 1.Institute of Engineering and Computational MechanicsUniversity of StuttgartStuttgartGermany

Personalised recommendations