Parallelization of a cluster algorithm
We present two algorithms to parallelize the identification of clusters on a lattice. Such algorithms are necessary for a variety of problems such as percolation and non-local spin update algorithms. The algorithms were tested for the Swendsen-Wang method for the simulation of the Ising model. The t...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Dokumenttyp: | Article (Journal) |
| Sprache: | Englisch |
| Veröffentlicht: |
7 December 1988
|
| In: |
Computer physics communications
Year: 1989, Jahrgang: 54, Heft: 2, Pages: 201-209 |
| ISSN: | 1879-2944 |
| DOI: | 10.1016/0010-4655(89)90082-9 |
| Online-Zugang: | Verlag, Volltext: http://dx.doi.org/10.1016/0010-4655(89)90082-9 Verlag, Volltext: http://www.sciencedirect.com/science/article/pii/0010465589900829 
|
| Verfasserangaben: | Anthony N. Burkitt and Dieter W. Heermann |
| Zusammenfassung: | We present two algorithms to parallelize the identification of clusters on a lattice. Such algorithms are necessary for a variety of problems such as percolation and non-local spin update algorithms. The algorithms were tested for the Swendsen-Wang method for the simulation of the Ising model. The tests were run on a multi-transputer system using up to 128 processors. A scaling law for the performance of geometric parallel algorithms is proposed and tested. |
|---|---|
| Beschreibung: | Gesehen am 22.08.2017 |
| Beschreibung: | Online Resource |
| ISSN: | 1879-2944 |
| DOI: | 10.1016/0010-4655(89)90082-9 |