Full metadata record
DC FieldValueLanguage
dc.contributor.authorDeng, Lih-Yuanen_US
dc.contributor.authorLi, Huajiangen_US
dc.contributor.authorShiau, Jyh-Jen Horngen_US
dc.date.accessioned2014-12-08T15:10:26Z-
dc.date.available2014-12-08T15:10:26Z-
dc.date.issued2009-01-01en_US
dc.identifier.issn0167-8191en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.parco.2008.09.012en_US
dc.identifier.urihttp://hdl.handle.net/11536/7971-
dc.description.abstractTo 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.en_US
dc.language.isoen_USen_US
dc.subjectDX-k-s generatoren_US
dc.subjectGeneralized Mersenne primeen_US
dc.subjectIrreducible polynomialen_US
dc.subjectLinear congruential generatoren_US
dc.subjectMRGen_US
dc.subjectPrimitive polynomialen_US
dc.titleScalable parallel multiple recursive generators of large orderen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.parco.2008.09.012en_US
dc.identifier.journalPARALLEL COMPUTINGen_US
dc.citation.volume35en_US
dc.citation.issue1en_US
dc.citation.spage29en_US
dc.citation.epage37en_US
dc.contributor.department統計學研究所zh_TW
dc.contributor.departmentInstitute of Statisticsen_US
dc.identifier.wosnumberWOS:000263480200003-
dc.citation.woscount3-
Appears in Collections:Articles


Files in This Item:

  1. 000263480200003.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.