A multiple-heaps algorithm for parallel simulation of collision systems
From MaRDI portal
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
- scientific article; zbMATH DE number 1082719 (Why is no real title available?)
- scientific article; zbMATH DE number 2110608 (Why is no real title available?)
- scientific article; zbMATH DE number 839542 (Why is no real title available?)
- A fast algorithm for particle simulations
- Concurrent Search and Insertion in AVL Trees
- Concurrent access of priority queues
- Concurrent search and insertion in 2-3 trees
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Molecular dynamics for polymeric fluids using discontinuous potentials
- Time and tape complexity of pushdown automaton languages
Cited in
(7)- A complexity O(1) priority queue for event driven molecular dynamics simulations
- How to simulate billiards and similar systems
- A heap-based algorithm for the study of one-dimensional particle systems.
- Algorithms for particle-field simulations with collisions
- Improved Generic Algorithms for 3-Collisions
- A hierarchic collision detection algorithm for simple Brownian dynamics
- Algorithm optimization in molecular dynamics simulation
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)
