Full metadata record
DC FieldValueLanguage
dc.contributor.authorDeng, Lih-Yuanen_US
dc.contributor.authorShiau, Jyh-Jen Horngen_US
dc.contributor.authorTsai, Gwei-Hungen_US
dc.date.accessioned2019-04-02T06:04:29Z-
dc.date.available2019-04-02T06:04:29Z-
dc.date.issued2009-01-01en_US
dc.identifier.urihttp://dx.doi.org/10.1007/978-3-642-04107-5_17en_US
dc.identifier.urihttp://hdl.handle.net/11536/150516-
dc.description.abstractClassical random number generators like Linear Congruential Generators (LCG) and Multiple Recursive Generators (MRG) are popular for large-scale simulation studies. To speed up the simulation process, a systematic method is needed to construct and parallelize the random number generators so that they can run simultaneously on several computers or processors. LCGs and MRGs have served as baseline generators for some parallel random number generator (PRNG) constructed in the literature. In this paper, we consider the parallelization problem particularly for a general class of efficient and portable large-order MRGs, in which most coefficients of the recurrence equation are nonzero. With many nonzero terms, such MRGs have an advantage over the MRGs with just a few nonzero terms that they can recover more quickly from a bad initialization. With the special structure imposed on the nonzero coefficients of the new class of generators, the proposed PRNGs can be implemented efficiently. A method of automatic generation of the corresponding MRGs for parallel computation is presented.en_US
dc.language.isoen_USen_US
dc.titleParallel Random Number Generators Based on Large Order Multiple Recursive Generatorsen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1007/978-3-642-04107-5_17en_US
dc.identifier.journalMONTE CARLO AND QUASI-MONTE CARLO METHODS 2008en_US
dc.citation.spage289en_US
dc.contributor.department理學院zh_TW
dc.contributor.departmentCollege of Scienceen_US
dc.identifier.wosnumberWOS:000282063700017en_US
dc.citation.woscount1en_US
Appears in Collections:Conferences Paper