Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Efficient and portable combined Tausworthe random number generators
Tezuka S., L’Ecuyer P. (ed) ACM Transactions on Modeling and Computer Simulation1 (2):99-112,1991.Type:Article
Date Reviewed: May 1 1992

The authors write about pseudorandom number generators as though they are generating true random numbers. As the techniques get better and better, it is easy to talk about “random number generators,” but we must be careful to keep in mind what we are doing. Aside from this, the paper is well done. It discusses the Tausworthe system, the improvements from combining two or more processes, and the benefits of portability. Portability is becoming more and more important. We need a single program that will produce the same series on any word size computer.

From the evidence in this paper, the Tausworthe system does seem to be better than the more common linear congruential methods. This paper gives strong theoretical support for the authors’ conclusions. Summary information about extensive results shows the goodness of the technique. A C program of only 11 lines implements the program. It is fast, generating one million pseudorandom numbers in 154 seconds on a 16 MHz 386 with a math coprocessor.

Several assumptions made throughout the paper require the reader to go back and review some earlier papers by L’Ecuyer. Access to those papers is almost essential to fully understanding this paper. The authors provide 26 good references.

Reviewer:  G. Carlson Review #: CR115928
Bookmark and Share
 
Random Number Generation (G.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Random Number Generation": Date
Stochastic investigations of pseudo-random number generators
Ugrin-Šparac G. Computing 46(1): 53-65, 1991. Type: Article
Apr 1 1992
Implementing a random number package with splitting facilities
L’Ecuyer P. (ed), Côté S. ACM Transactions on Mathematical Software 17(1): 98-111, 1991. Type: Article
Nov 1 1991
How to generate cryptographically strong sequences of pseudo-random bits
Blum M., Micali S. SIAM Journal on Computing 13(4): 850-864, 1984. Type: Article
May 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy