A Feasible Parallel Monte Carlo Algorithm to Simulate Templated Grain Growth

Abstract:

Article Preview

It is proposed a parallel Monte Carlo algorithm to simulate templated grain growth in sintering ceramics materials. The algorithm applies the general Potts model to treat the matrix as the discrete lattices for simulating the grain growth and there will be a number of lattices to be computed synchronously. The scheme is performed by CUDA GPU parallelization programming framework which is of much more feasibility and low cost comparing with the former conventional program. The most key point is that the parallel algorithm is of great temporal performance which means it takes less time to complete a simulation. The results of comparative experiments show that the algorithm is unquestionable effective while the other statistic numerical features of simulations are almost the same.

Info:

Periodical:

Advanced Materials Research (Volumes 332-334)

Edited by:

Xiaoming Qian and Huawu Liu

Pages:

1868-1871

DOI:

10.4028/www.scientific.net/AMR.332-334.1868

Citation:

X. Luo et al., "A Feasible Parallel Monte Carlo Algorithm to Simulate Templated Grain Growth", Advanced Materials Research, Vols. 332-334, pp. 1868-1871, 2011

Online since:

September 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.