Generation of the Scrambled Halton Sequence Using Accelerators
Grid Technologies and Applications, Institute for Information and Communication Technologies, Bulgarian Academy of Sciences, Acad. G. Bonchev str. 25-A, Sofia 1113, Bulgaria
36th International Convention on Information and Communication Technology, Electronics and Microelectronics, 2013
@article{atanassov2013generation,
title={Generation of the Scrambled Halton Sequence Using Accelerators},
author={Atanassov, Emanouil and Durchova, Mariya},
year={2013}
}
The Halton sequence is one of the most popular low-discrepancy sequences. In order to satisfy some practical requirements, the original sequence is usually modified in some way. The scrambling algorithm, proposed by Owen, has several theoretical advantages, but on the other hand is difficult to implement in practice due to the trade-off between high memory and high computational requirements. In our work we concentrate on the case when the number of coordinates is relatively high. The use of computational accelerators and especially GPUs is increasingly relevant for such practical applications, since more and more of the resources, available through the Grid and Cloud infrastructures, provide access to such accelerators, provided that the software can make use of them. In this paper we discuss our algorithm for generation of the Halton sequence with Owen-type scrambling implemented using NVIDIA CUDA. We also show numerical results, achieved on our GPU-enabled nodes, which are equipped with NVIDIA M2090 cards.
September 4, 2013 by hgpu
