標題: Scalable parallel multiple recursive generators of large order
作者: Deng, Lih-Yuan
Li, Huajiang
Shiau, Jyh-Jen Horng
統計學研究所
Institute of Statistics
關鍵字: DX-k-s generator;Generalized Mersenne prime;Irreducible polynomial;Linear congruential generator;MRG;Primitive polynomial
公開日期: 1-一月-2009
摘要: To speed up the process of performing a large statistical simulation study, it is natural and common to divide the large-scale simulation task into several relatively independent sub-tasks in a way that these sub-tasks can be handled by individual processors in parallel. To obtain a good overall simulation result by synthesizing results from these sub-tasks, it is crucial that good parallel random number generators are used. Thus, designing suitable and independent uniform random number generators for the sub-tasks has become a very important issue in large-scale parallel simulations. Two commonly used uniform random number generators, linear congruential generator (LCG) and multiple recursive generator (MRG), have served as backbone generators for some parallel random number generators constructed in the past. We will discuss some general construction methods. A systematic leapfrog method to automatically choose different multipliers for LCGs to have the maximum-period and a method to construct many maximum-period MRGs from a single MRG are available in the literature. In this paper, we propose to combine both approaches to generate different MRGs "randomly", quickly and automatically. while retaining the maximum-period property. Published by Elsevier B.V.
URI: http://dx.doi.org/10.1016/j.parco.2008.09.012
http://hdl.handle.net/11536/7971
ISSN: 0167-8191
DOI: 10.1016/j.parco.2008.09.012
期刊: PARALLEL COMPUTING
Volume: 35
Issue: 1
起始頁: 29
結束頁: 37
顯示於類別:期刊論文


文件中的檔案:

  1. 000263480200003.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。