Efficient parallel simulations of dynamic Ising spin systems
Many of the important computational aspects of fundamental problems in Physical Sciences have been attracting much attention of late. Efficient handling of modelling and simulation, while solving problems calls for the discovery of apt and time-saving algorithms. There are seven sections: Introduction, Saturated algorithms, Examples, Super-saturation and the BKL algorithm, Collecting statistics, Performance and Conclusion. The paper demonstrates in explicit terms an effective parallel scheme for simulating continuous time Ising spin systems. The intimate contacts between several features of the basic spin physics as well as computational intricacies are carefully discussed, their being a very challenging mathematical problem also.
- Efficient algorithms for parallelizing Monte Carlo simulations for 2D Ising spin models
- Parallelization of a dynamic Monte Carlo algorithm: A partially rejection-free conservative approach
- scientific article; zbMATH DE number 124510
- Parallelization of the Ising model and its performance evaluation
- Parallelization of Simulations for Various Magnetic System Models on Small-Sized Cluster Computers with MPI
- Beitrag zur Theorie des Ferromagnetismus
- Equation of state calculations by fast computing machines
- scientific article; zbMATH DE number 3954143 (Why is no real title available?)
- scientific article; zbMATH DE number 4056645 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- Markov chain models - rarity and exponentiality
- Time-Dependent Statistics of the Ising Model
- A fast algorithm for the Cyber 205 to simulate the 3D Ising model
- Improved parallel implementation of the two-dimensional Ising model
- Information criteria for quantifying loss of reversibility in parallelized KMC
- Parallelization of a dynamic Monte Carlo algorithm: A partially rejection-free conservative approach
- Parallel simulation of two-dimensional Ising models using probabilistic cellular automata
- Jump Markov chains and rejection-free Metropolis algorithms
- Simulation reductions for the Ising model
- Synchronous parallel kinetic Monte Carlo for continuum diffusion-reaction systems
- Hybrid asynchronous algorithm for parallel kinetic Monte Carlo simulations of thin film growth
- Extreme fluctuations in noisy task-completion landscapes on scale-free networks
- Parallel simulations in ferromagnetic spin systems
- Parallel computing of Edwards-Anderson model
- Diffusion processes on small-world networks with distance dependent random links
- Self-organized criticality in simulated correlated systems
- Simple parallel algorithms for single-site dynamics
- Exposing inter-process information for efficient PDEs of spatial stochastic systems on multicores
- Hierarchical fractional-step approximations and parallel kinetic Monte Carlo algorithms
- Massively parallel kinetic Monte Carlo simulations of charge carrier transport in organic semiconductors
- Parallelization of the Ising model and its performance evaluation
- Efficient algorithms for parallelizing Monte Carlo simulations for 2D Ising spin models
This page was built for publication: Efficient parallel simulations of dynamic Ising spin systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101175)