Benchmarking High-Performance Computing Systems By Means of Local-Creutz Simulations of the d = 2 Ising Model

Abstract

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 16² 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.