We have benchmarked various high-performance com puter systems by means of a code that solves the Ising model in two dimensions. We use a simple and porta ble Fortran implementation of the local-Creutz algo rithm. We compare the wall-clock times needed to per form 250,000 iterations of the algorithm on a lattice of 162 spins, for the Thinking Machines Corporation CM-2, the NEC SX-2, one CRAY Y-MP 4/32 processor, the Alliant FX/2800 with a variable number of proces sors, the IBM 3090-200 VF, an IBM 6000 RISC worksta tion, and a Silicon Graphics Iris workstation.
Get full access to this article
View all access options for this article.
References
1.
Bhanot, G., Creutz, M., and Neuberger, H.1984. Microcanonical simulation of Ising systems. Nucl. Phys. B 235:417-434.
2.
Brower, R.C., Moriarty, K.J.M., Myers, E., Orland, P., and Tamayo, P.1988. Critical slowing down in microcanonical Ising dynamics . Phys. Rev. B 38:11471-11475.
3.
Creutz, M.1983. Microcanonical Monte Garlo simulation. Phys. Rev. Lett.50:1411-1414.
4.
Creutz, M., and Moriarty, K.J.M.1986. Fortran code for the three-dimensional Ising model. Cmnput. Phys. Commun.39: 173-180.
5.
Landau, L.D., and Lifshitz, E.M.1980. Course on theoretical physics: statistical physics , vol. 5, part 1, 3rd ed. New York: Pergamon Press .
6.
Onsager, L.1944. Crystal statistics. I. A two-dimensional model with an order-disorder transition. Phys. Rev.65:117-149.
7.
Toffoli, T., and Margolus, N.1988. Cellular automata machines. Cambridge, Massachusetts: The MIT Press.
