Fast algorithm for generating random bit strings and multispin coding for directed percolation
Statistical Mechanics
2019-02-07 v2 Computational Physics
Abstract
We present efficient algorithms to generate a bit string in which each bit is set with arbitrary probability. By adopting a hybrid algorithm, i.e., a finite-bit density approximation with correction techniques, we achieve 3.8 times faster random bit generation than the simple algorithm for the 32-bit case and 6.8 times faster for the 64-bit case. Employing the developed algorithm, we apply the multispin coding technique to one-dimensional bond-directed percolation. The simulations are accelerated by up to a factor of 14 compared with an optimized scalar implementation. The random bit string generation algorithm proposed here is applicable to general Monte Carlo methods.
Cite
@article{arxiv.1808.05009,
title = {Fast algorithm for generating random bit strings and multispin coding for directed percolation},
author = {Hiroshi Watanabe and Satoshi Morita and Synge Todo and Naoki Kawashima},
journal= {arXiv preprint arXiv:1808.05009},
year = {2019}
}
Comments
9 pages, 7 figures