Finding the best portable congruential random number generators
Computer Physics Communications
1889 - 1897
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/20878
Linear 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=LeftFloor;M/B⌋. 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 263-25, suitable for 64-bit register size, and determined 12 high quality portable generators successfully passing stringent spectral and empirical tests. © 2013 Elsevier B.V. All rights reserved.
- Work in Progress 1224
Showing items related by title, author, creator and subject.
Sezgin F.; Metin Sezgin, T. (2006)We present statistical analysis of blocks in the binary expansions of Feigenbaum constants α and δ for the logistic map. The analysis is carried out on both 1016 and 3400 bit expansions. A χ2 test is applied for lumping ...
Sezgin F. (2006)We discuss the lattice structure of congruential random number generators and examine figures of merit. Distribution properties of lattice measures in various dimensions are demonstrated by using large numerical data. ...
Sezgin F. (2009)The Geometric Random Inner Product (GRIP) is a recently developed test method for randomness. As a relatively new method, its properties, weaknesses, and strengths are not well documented. In this paper, we provide a ...