Show simple item record

dc.contributor.authorSezgin, F.en_US
dc.contributor.authorSezgin, T. M.en_US
dc.date.accessioned2015-07-28T11:57:24Z
dc.date.available2015-07-28T11:57:24Z
dc.date.issued2013-08en_US
dc.identifier.issn0010-4655
dc.identifier.urihttp://hdl.handle.net/11693/11332
dc.description.abstractLinear congruential random number generators must have large moduli to attain maximum periods, but this creates integer overflow during calculations. Several methods have been suggested to remedy this problem while obtaining portability. Approximate factoring is the most common method in portable implementations, but there is no systematic technique for finding appropriate multipliers and an exhaustive search is prohibitively expensive. We offer a very efficient method for finding all portable multipliers of any given modulus value. Letting M = AB+C, the multiplier A gives a portable result if B-C is positive. If it is negative, the portable multiplier can be defined as A = left perpendicularM/Brightperpendicular. We also suggest a method for discovering the most fertile search region for spectral top-quality multipliers in a two-dimensional space. The method is extremely promising for best generator searches in very large moduli: 64-bit sizes and above. As an application to an important and challenging problem, we examined the prime modulus 2(63)-25, suitable for 64-bit register size, and determined 12 high quality portable generators successfully passing stringent spectral and empirical tests.en_US
dc.language.isoEnglishen_US
dc.source.titleComputer Physics Communicationsen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cpc.2013.03.013en_US
dc.subjectLattice structureen_US
dc.subjectLinear congruential generatoren_US
dc.subjectPortabilityen_US
dc.subjectRandom numberen_US
dc.subjectSpectral testen_US
dc.titleFinding the best portable congruential random number generatorsen_US
dc.typeArticleen_US
dc.departmentBusiness Information Managementen_US
dc.citation.spage1889en_US
dc.citation.epage1897en_US
dc.citation.volumeNumber184en_US
dc.citation.issueNumber8en_US
dc.identifier.doi10.1016/j.cpc.2013.03.013en_US
dc.publisherElsevieren_US
dc.identifier.eissn1879-2944


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record