Synchronous relaxation algorithm for parallel kinetic Monte Carlo

Physics – Condensed Matter – Materials Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 15 figures

Scientific paper

We investigate the applicability of the synchronous relaxation (SR) algorithm to parallel kinetic Monte Carlo simulations of simple models of thin-film growth. A variety of techniques for optimizing the parallel efficiency are also presented. We find that the parallel efficiency is determined by three main factors $-$ the calculation overhead due to relaxation iterations to correct boundary events in neighboring processors, the (extreme) fluctuations in the number of events per cycle in each processor, and the overhead due to interprocessor communications. Due to the existence of fluctuations and the requirement of global synchronization, the SR algorithm does not scale, i.e. the parallel efficiency decreases logarithmically as the number of processors increases. The dependence of the parallel efficiency on simulation parameters such as the processor size, domain decomposition geometry, and the ratio $D/F$ of the monomer hopping rate $D$ to the deposition rate $F$ is also discussed.

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

Synchronous relaxation algorithm for parallel kinetic Monte Carlo 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 Synchronous relaxation algorithm for parallel kinetic Monte Carlo, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synchronous relaxation algorithm for parallel kinetic Monte Carlo will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-247289

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