Skip to main content

Dynamic Creation of Pseudorandom Number Generators

  • Conference paper
Monte-Carlo and Quasi-Monte Carlo Methods 1998

Abstract

We propose a new scheme Dynamic Creation (DC) of pseudorandom number generators (PRNG) for large scale Monte Carlo simulations in parallel or distributed systems. DC receives user’s specification such as word size, period, size of working area, together with a process ID (or a set of IDs). Then DC creates a PRNG (or a set of PRNGs, respectively) satisfying the specification, so that ID number is encoded in the characteristic polynomial of PRNG. Thus, different IDs assure highly independent PRNGs. Each PRNG is a small Mersenne Twister, which we proposed previously.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Couture, R., L’Ecuyer P., Tezuka, S.: On the distribution of k-dimensional vectors for simple and combined Tausworthe sequences, Math. Comput., 60(1993) 749 – 761

    MATH  MathSciNet  Google Scholar 

  2. Knuth, D.E.: Seminumerical Algorithms. 3rd ed., Vol 2, The Art of Computer Programming, Addison Wesley, Reading, MA., (1997)

    Google Scholar 

  3. Lenstra, A.K.: Factoring multivariate polynomials over finite fields, J. Com- put. Syst. Sci., 30(1985) 235 – 248

    Article  MATH  MathSciNet  Google Scholar 

  4. Matsumoto, M., Kurita, Y.: Twisted GFSR generators II, ACM Trans. Model. Comput. Simul., 4(1994) 254 – 266

    MATH  Google Scholar 

  5. Matsumoto, M., Nishimura, T.: Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator, ACM Trans. Model. Comput. Simul., 8(1998) 3 – 30

    Article  MATH  Google Scholar 

  6. Tezuka, S.: Lattice structure of pseudorandom sequence from shift register generators, Proceedings of the 1990 Winter Simulation Conference, IEEE (1990) 266 – 269

    Google Scholar 

  7. Tezuka, S.: The k-dimensional distribution of combined GFSR sequences, Math. Comput., 62(1994) 809 – 817

    MATH  MathSciNet  Google Scholar 

  8. Tezuka, S.: Uniform Random Numbers: Theory and Practice, Kluwer, (1995)

    Book  MATH  Google Scholar 

  9. Tootill, J.P.R., Robinson, W.D., Adams, A.G.: The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators, J. ACM, 18(1971), 381 – 399

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matsumoto, M., Nishimura, T. (2000). Dynamic Creation of Pseudorandom Number Generators. In: Niederreiter, H., Spanier, J. (eds) Monte-Carlo and Quasi-Monte Carlo Methods 1998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59657-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59657-5_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66176-4

  • Online ISBN: 978-3-642-59657-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics