|
ABSTRACT
Although superficially time-consuming, on 32-bit computers the minimal standard random number generator can be implemented with surprising economy.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Lewis, P.A., Goodman, A.S., and Miller, J.M. A pseudo.random number generator for the System/360. IBM Syst. J. 8, 2 (1969), 136-146.
|
 |
2
|
|
 |
3
|
|
CITED BY 13
|
|
|
|
|
|
|
|
Jennifer M. Anderson , Lance M. Berc , Jeffrey Dean , Sanjay Ghemawat , Monika R. Henzinger , Shun-Tak A. Leung , Richard L. Sites , Mark T. Vandevoorde , Carl A. Waldspurger , William E. Weihl, Continuous profiling: where have all the cycles gone?, ACM SIGOPS Operating Systems Review, v.31 n.5, p.1-14, Dec. 1997
|
|
|
|
|
|
|
|
|
Jennifer M. Anderson , Lance M. Berc , Jeffrey Dean , Sanjay Ghemawat , Monika R. Henzinger , Shun-Tak A. Leung , Richard L. Sites , Mark T. Vandevoorde , Carl A. Waldspurger , William E. Weihl, Continuous profiling: where have all the cycles gone?, ACM Transactions on Computer Systems (TOCS), v.15 n.4, p.357-390, Nov. 1997
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|