.png){kind=icon}
返回
A parallel implementation of the Wang-Landau algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cpc.2008.04.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Wang-Landau algorithm is a flat-histogram Monte Carlo method that performs random walks in the configuration space of a system to obtain a close estimation of the density of states iteratively. It has been applied successfully to many research fields. In this paper, we propose a parallel implementation of the Wang-Landau algorithm on computers of shared memory architectures by utilizing the OpenMP API for distributed computing. This implementation is applied to Ising model systems with promising speedups. We also examine the effects on the running speed when using different strategies in accessing the shared memory space during the updating procedure. The allowance of data race is recommended in consideration of the simulation efficiency. Such treatment does not affect the accuracy of the final density of states obtained. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Wang-Landau
Monte Carlo
OpenMP
distributed computing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
1.2W
被引数:
3.7W
机构
引用论文
Determining the density of states for classical statistical models by a flat-histogram random walk
.png){kind=icon}
PREAI
分享收藏
查看更多内容