A multiple-heaps algorithm for parallel simulation of collision systems
From MaRDI portal
Publication:697736
DOI10.1006/JCPH.2002.7073zbMATH Open1001.82505OpenAlexW2018918149MaRDI QIDQ697736FDOQ697736
Authors: Mo Mu 
Publication date: 17 September 2002
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcph.2002.7073
Recommendations
- A heap-based algorithm for the study of one-dimensional particle systems.
- Algorithms for particle-field simulations with collisions
- Fast parallel algorithms for short-range molecular dynamics
- A cost optimal parallel algorithm for computing force field in \(N-\)body simulations on a CREW PRAM
- Parallel-vector algorithms for particle simulations on shared-memory multiprocessors
Cites Work
- A fast algorithm for particle simulations
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Title not available (Why is that?)
- Time and tape complexity of pushdown automaton languages
- Title not available (Why is that?)
- Molecular dynamics for polymeric fluids using discontinuous potentials
- Title not available (Why is that?)
- Concurrent search and insertion in 2-3 trees
- Concurrent access of priority queues
- Concurrent Search and Insertion in AVL Trees
Cited In (7)
- Algorithm optimization in molecular dynamics simulation
- A heap-based algorithm for the study of one-dimensional particle systems.
- Improved Generic Algorithms for 3-Collisions
- A complexity O(1) priority queue for event driven molecular dynamics simulations
- A hierarchic collision detection algorithm for simple Brownian dynamics
- How to simulate billiards and similar systems
- Algorithms for particle-field simulations with collisions
This page was built for publication: A multiple-heaps algorithm for parallel simulation of collision systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697736)
