Scaling properties of geometric parallelization

A. Jakobs and R.W. Gerling

Physica A: Statistical Mechanics and its Applications, 1992, vol. 180, issue 3, 407-418

Abstract: We present a universal scaling law for all geometrically parallelized computer simulation algorithms. For algorithms with local interaction laws we calculate the scaling exponents for zero and infinite lattice size. The scaling is tested on local (cellular automata, Metropolis Ising) as well as cluster (Swendsen-Wang) algorithms. The practical aspects of the scaling properties lead to a simple recipe for finding the optimum number of processors to be used for the parallel simulation of a particular system.

Date: 1992
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378437192903979
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:180:y:1992:i:3:p:407-418

DOI: 10.1016/0378-4371(92)90397-9

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().