Parallelization of the Ising model and its performance evaluation
From MaRDI portal
In this interesting paper the authors consider parallelization of two widely used algorithms in computational physics, i.e., the Monte Carlo simulation of the Ising model and a cluster identification algorithm which is used for percolation and percolation-like problems. The authors describe an implementation of their algorithms on a multitransputer system based on sixteen T800 transputers. The results of computations are thoroughly discussed and performance evaluation on scalar and vector computers is given.
Recommendations
- Parallelization of a dynamic Monte Carlo algorithm: A partially rejection-free conservative approach
- Monte Carlo simulation on transputer arrays
- Efficient parallel simulations of dynamic Ising spin systems
- Efficient algorithms for parallelizing Monte Carlo simulations for 2D Ising spin models
- Parallelization of Simulations for Various Magnetic System Models on Small-Sized Cluster Computers with MPI
Cited in
(7)- Efficient parallel simulations of dynamic Ising spin systems
- Improved parallel implementation of the two-dimensional Ising model
- High-performance computations in multi-agent simulation problems of percolation cluster's behavior
- Parallel simulation of two-dimensional Ising models using probabilistic cellular automata
- Parallelization of Simulations for Various Magnetic System Models on Small-Sized Cluster Computers with MPI
- Performance potential for simulating spin models on GPU
- Efficient algorithms for parallelizing Monte Carlo simulations for 2D Ising spin models
This page was built for publication: Parallelization of the Ising model and its performance evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918111)