Simulation of percolation on massively-parallel computers

Details Simulation of percolation on massively-parallel computers Simulation of percolation on massively-parallel computers

2001-06-18

arxiv.org/abs/cond-mat/0106354v1

Physics

Condensed Matter

Statistical Mechanics

9 pages, submitted to Int. J. Mod. Phys. C

Scientific paper

10.1142/S012918310100205X

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 to L=4000256 in two dimensions, L=20224 in three, and L=1036 in four, gave precise estimates for the Fisher exponent tau, the corrections to scaling Delta_1, and for the critical number density n_c.

Affiliated with

Also associated with

No associations

Rating

Simulation of percolation on massively-parallel computers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simulation of percolation on massively-parallel computers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulation of percolation on massively-parallel computers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-239941