.png){kind=icon}
返回
An embarrassingly parallel algorithm for random walk simulations on random fractal structures
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jocs.2016.11.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Anomalous diffusion is often simulated by random walks on random fractal structures. As existing simulation methods either lack a high degree of parallelism or impose restrictions on the choice of fractal structures, a new approach is proposed here. We present a parallel algorithm for simulating random walks on fractal structures that is suitable for a wide variety of hardware architectures. The degree of parallelism of the algorithm equals the number of random walkers, which is achieved by its communication-avoiding design. In contrast to other approaches, the random fractal structure is not pre-computed at whole. Instead, only the surrounding of each random walker is calculated by the parallel threads while the random walker moves around on the fractal structure. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Random-walk simulation
Random fractal structures
GPU
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
18.3
论文数:
3.1K
被引数:
4.0K
.png){kind=icon}
查看更多内容