Vectorized Cluster Search
| dc.creator | Evertz, Hans Gerd | |
| dc.date | 1992-04-08 | |
| dc.date.accessioned | 2026-07-07T03:39:19Z | |
| dc.date.available | 2026-07-07T03:39:19Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/hep-lat/9112001 | |
| dc.identifier | http://arxiv.org/abs/hep-lat/9112001 | |
| dc.identifier | Nucl.Phys.Proc.Suppl. 26 (1992) 620-622 | |
| dc.identifier | doi:10.1016/0920-5632(92)90351-R | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/38878 | |
| dc.subject | High Energy Physics - Lattice | |
| dc.title | Vectorized Cluster Search | |
| dc.type | text |