SIMULATION OF PERCOLATION ON MASSIVELY-PARALLEL COMPUTERS

Daniel Tiggemann ()
Additional contact information
Daniel Tiggemann: Institute for Theoretical Physics, Cologne University, 50937 Köln, Germany, Europen Union, Germany

International Journal of Modern Physics C (IJMPC), 2001, vol. 12, issue 06, 871-878

Abstract: A novel approach to parallelize the well-known Hoshen–Kopelman algorithm has been chosen, suitable for simulating huge lattices in high dimensions on massively-parallel computers with distributed memory and message passing. This method consists of domain decomposition of the simulated lattice into strips perpendicular to the hyperplane of investigation that is used in the Hoshen–Kopelman algorithm. Systems of world record sizes, up toL = 4 000 256in two dimensions,L = 20 224in three, andL = 1036in four, gave precise estimates for the Fisher exponent τ, the corrections to scalingΔ1, and for the critical number densitync.

Keywords: Percolation; Hoshen–Kopelman Algorithm; Parallel Computing; Domain Decomposition; World Records (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S012918310100205X
Access to full text is restricted to subscribers

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:wsi:ijmpcx:v:12:y:2001:i:06:n:s012918310100205x

Ordering information: This journal article can be ordered from

DOI: 10.1142/S012918310100205X

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().