Abstract
Linear recurring sequences with very large periods are widely used as the basic building block of pseudorandom number generators. In many simulation applications, multiple streams of random numbers are needed, and these multiple streams are normally provided by jumping ahead in the sequence to obtain starting points that are far apart. For maximal-period generators having a large state space, this jumping ahead can be costly in both time and memory usage. We propose a new jump ahead method for this kind of situation. It requires much less memory than the fastest algorithms proposed earlier, while being approximately as fast (or faster) for generators with a large state space such as the Mersenne twister.
This work was supported in part by JSPS Grant-In-Aid #16204002, #18654021, #19204002, JSPS Core-to-Core Program No.18005, NSERC-Canada, and a Canada Research Chair to the third author.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Law, A.M., Kelton, W.D.: Simulation Modeling and Analysis, 3rd edn. McGraw-Hill, New York (2000)
L’Ecuyer, P., Buist, E.: Simulation in Java with SSJ. In: Proceedings of the 2005 Winter Simulation Conference, pp. 611–620. IEEE Press, Los Alamitos (2005)
L’Ecuyer, P.: Pseudorandom number generators. In: Platen, E., Jaeckel, P. (eds.) Simulation Methods in Financial Engineering. Encyclopedia of Quantitative Finance. Wiley, Chichester (forthcoming, 2008)
Matsumoto, M., Nishimura, T.: Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation 8(1), 3–30 (1998)
Panneton, F., L’Ecuyer, P., Matsumoto, M.: Improved long-period generators based on linear recurrences modulo 2. ACM Transactions on Mathematical Software 32(1), 1–16 (2006)
Haramoto, H., Matsumoto, M., Nishimura, T., Panneton, F., L’Ecuyer, P.: Efficient jump ahead for F 2-linear random number generators. INFORMS Journal on Computing (to appear, 2008)
Panneton, F., L’Ecuyer, P.: Infinite-dimensional highly-uniform point sets defined via linear recurrences in \(\mathbb{F}_{2^w}\). In: Niederreiter, H., Talay, D. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2004, pp. 419–429. Springer, Berlin (2006)
L’Ecuyer, P.: Uniform random number generation. Annals of Operations Research 53, 77–120 (1994)
L’Ecuyer, P., Panneton, F.: F 2-linear random number generators. In: Alexopoulos, C., Goldsman, D. (eds.) Advancing the Frontiers of Simulation: A Festschrift in Honor of George S. Fishman, Spinger, New York (to appear, 2007)
Couture, R., L’Ecuyer, P.: Lattice computations for random numbers. Mathematics of Computation 69(230), 757–765 (2000)
Shoup, V.: NTL: A Library for doing Number Theory. Courant Institute, New York University, New York (2005), http://shoup.net/ntl/
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (2003)
Golomb, S.W.: Shift-Register Sequences. Holden-Day, San Francisco (1967)
Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Heidelberg (1986)
Matsumoto, M., Kurita, Y.: Twisted GFSR generators II. ACM Transactions on Modeling and Computer Simulation 4(3), 254–266 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haramoto, H., Matsumoto, M., L’Ecuyer, P. (2008). A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds) Sequences and Their Applications - SETA 2008. SETA 2008. Lecture Notes in Computer Science, vol 5203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85912-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-85912-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85911-6
Online ISBN: 978-3-540-85912-3
eBook Packages: Computer ScienceComputer Science (R0)