q-State Potts model metastability study using optimized GPU-based Monte Carlo algorithms

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

30 pages, 7 figures. Accepted in Computer Physics Communications. code available at: http://www.famaf.unc.edu.ar/grupos/GPGP

Scientific paper

10.1016/j.cpc.2012.02.026

We implemented a GPU based parallel code to perform Monte Carlo simulations of the two dimensional q-state Potts model. The algorithm is based on a checkerboard update scheme and assigns independent random numbers generators to each thread. The implementation allows to simulate systems up to ~10^9 spins with an average time per spin flip of 0.147ns on the fastest GPU card tested, representing a speedup up to 155x, compared with an optimized serial code running on a high-end CPU. The possibility of performing high speed simulations at large enough system sizes allowed us to provide a positive numerical evidence about the existence of metastability on very large systems based on Binder's criterion, namely, on the existence or not of specific heat singularities at spinodal temperatures different of the transition one.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

q-State Potts model metastability study using optimized GPU-based Monte Carlo algorithms 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 q-State Potts model metastability study using optimized GPU-based Monte Carlo algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and q-State Potts model metastability study using optimized GPU-based Monte Carlo algorithms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-266121

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.