HPF Application Kernels


Metropolis Monte Carlo Simulation for Spin Models

Serial Number: 0036

Author(s):
Paul Coddington, paulc@npac.syr.edu

Abstract:
Uses Metropolis Monte Carlo algorithm to simulate an Ising spin model of a ferromagnet, and calculate the energy and magnetization at a particular temperature.

Implementation and Performance Issues:
This is a good example of a regular grid algorithm with local communications, which should be implemented efficiently in HPF. The only possible problem with obtaining good performance is that the computation to communication ratio is quite small, so the efficiency may not be good unless the compiler implements blocked communications (i.e. passes all edge information at once, rather than one grid point at a time). The message passing code has two versions which use blocked and non-blocked communications, with the latter being much less efficient.

Documentation:
Program documentation is available.
Code:


Written 1995 by PDC.
Last updated 21 June 1997 by PDC.
For further information, contact HPFA maintainers.
Return to HPFA Home Page.