Vectorized Cluster Search

Details Vectorized Cluster Search Vectorized Cluster Search

1992-04-08

arxiv.org/abs/hep-lat/9112001v1

Nucl.Phys.Proc.Suppl. 26 (1992) 620-622

Physics

High Energy Physics

High Energy Physics - Lattice

Scientific paper

10.1016/0920-5632(92)90351-R

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.

Affiliated with

Also associated with

No associations

Rating

Vectorized Cluster Search 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 Vectorized Cluster Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vectorized Cluster Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-545481