|
| | | | |
| | | |
| Stat |
Members: 3664
Articles: 2'599'751
Articles rated: 2609
26 December 2024 |
|
| | | | |
|
Article overview
| |
|
|
Vectorized Cluster Search | | Hans Gerd Evertz
; | | Date: |
9 Apr 1992 | | Journal: | Nucl.Phys.Proc.Suppl. 26 (1992) 620-622 DOI: 10.1016/0920-5632(92)90351-R | | Subject: | hep-lat | | Abstract: | Contrary to conventional wisdom, the construction of clusters on a lattice can easily be vectorized, namely over each ``generation’’ in a breadth first search. This applies directly to, e.g., the {it single cluster} variant of the Swendsen-Wang algorithm. On a Cray Y-MP, total CPU time was reduced by a factor 3.5 -- 7 in actual applications. | | Source: | arXiv, hep-lat/9112001 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER