The three-dimensional Ising Checkerboard Decomposition model solves the Ising model on a parallel computer by partitioning the spin lattice into alternating squares, as on a red and black checkerboard, and uses the property that squares of the same partition only interact with neighboring squares of the opposite partition. Using a lattice with one million sites, we use a parallel loop to test half a million configurations by flipping squares of a single partition before switching to the other partition.
The parallel loop used in this simulation behaves like a standard loop except that iterations are performed concurrently on separate processors. Additional windows display a cross section through the cubical spin lattice and a histogram showing how may spin flips are performed by each thread.
The Ising 3D Checkerboard Decomposition Model was developed using the Easy Java Simulations (Ejs) modeling tool. It is distributed as a ready-to-run (compiled) Java archive. Double clicking the jar file will run the program if Java is installed.
Please note that this resource requires
at least version 1.6 of
Ising 3D Checkerboard Decomposition Source Code
The source code zip archive contains an XML representation of the Ising 3D Checkerboard Decomposition Model. Unzip this archive in your Ejs workspace to compile and run this model using Ejs. download 144kb .zip
Last Modified: August 10, 2014
Christian, W. (2013). Ising 3D Checkerboard Decomposition Model (Version 1.0) [Computer software]. Retrieved May 27, 2016, from http://www.compadre.org/Repository/document/ServeFile.cfm?ID=13033&DocID=3602
%0 Computer Program %A Christian, Wolfgang %D October 14, 2013 %T Ising 3D Checkerboard Decomposition Model %7 1.0 %8 October 14, 2013 %U http://www.compadre.org/Repository/document/ServeFile.cfm?ID=13033&DocID=3602
Disclaimer: ComPADRE offers citation styles as a guide only. We cannot offer interpretations about citations as this is an automated procedure. Please refer to the style manuals in the Citation Source Information area for clarifications.