Pseudorandom number generators for supercomputers and classical computers: A practical introduction

DOI10.1016/0377-2217(92)90056-FzbMath0791.65003OpenAlexW1964134908MaRDI QIDQ1206601

Ben Annink, Jack P. C. Kleijnen

Publication date: 1 April 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90056-f

zbMATH Keywords

parallel algorithmslong range correlationssupercomputerspseudorandom number generatorsvector computersmultiplicative congruential generator

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Toward a universal random number generator
• A method for vectorized random number generators
• Parallelization of random number generators and long-range correlations
• The lattice structure of pseudo-random vectors generated by matrix generators
• Simulation methodology - an introduction for queueing theorists
• Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP

This page was built for publication: Pseudorandom number generators for supercomputers and classical computers: A practical introduction