RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher

  title={RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of L{\"u}scher},
  author={F. James},
  journal={Computer Physics Communications},
  • F. James
  • Published 1994
  • Computer Science
  • Computer Physics Communications
Abstract Following some remarks on the quality of pseudorandom number generators commonly used in Monte Carlo calculations in computational physics, we offer a portable Fortran 77 implementation of a high-quality generator called RANLUX (for LUXury RANdom numbers), using the algorithm of Martin Luscher described in an accompanying article. The implementation allows the user to select different quality or luxury levels, where higher quality requires somewhat longer computing time for the… Expand
Efficient pseudo-random number generation for monte-carlo simulations using graphic processors
A hybrid approach based on the combination of three Tausworthe generators and one linear congruential generator for pseudo random number generation for GPU programing as suggested in NVIDIA-CUDAExpand
A comparative study of some pseudorandom number generators
Abstract We present results of a test program of a group of pseudorandom number generators which are commonly used in the applications of physics, in particular in Monte Carlo simulations. TheExpand
Implementation of a RANLUX Based Pseudo-Random Number Generator in FPGA Using VHDL and Impulse C
The authors introduce the world's first implementation of the RANLUX algorithm on an FPGA platform for high performance computing purposes, and has an extremely low power demand, which makes it perfect for use in environment friendly and energy-efficient supercomputing solutions and embedded systems. Expand
Common defects in initialization of pseudorandom number generators
We demonstrate that a majority of modern random number generators, such as the newest version of rand.c, ranlux, and combined multiple recursive generators, have some manifest correlations in theirExpand
RANEXP: experimental random number generator package
Abstract A library containing highly portable implementations of most algorithms for (pseudo) random number generation has been developed, which might be used in any area of simulation which requiresExpand
Pseudo-random number generators for Monte Carlo simulations on ATI Graphics Processing Units
  • V. Demchik
  • Computer Science, Physics
  • Comput. Phys. Commun.
  • 2011
Basic uniform pseudo-random number generators are implemented on ATI Graphics Processing Units (GPU) and RANLUX generator is found to be the most appropriate for using on GPU in Monte Carlo simulations. Expand
A study of 64-bit multipliers for Lehmer pseudorandom number generators
Abstract A study was conducted of multipliers for 64-bit congruential pseudorandom number generators. Extensive analysis and testing resulted in the identification of over 200 good multipliers of theExpand
A Portable Implementation of RANLUX++
High energy physics has a constant demand for random number generators (RNGs) with high statistical quality. In this paper, we present ROOT’s implementation of the RANLUX++ generator. We discuss theExpand
A revision of the subtract-with-borrow random number generators
The most popular and widely used subtract-with-borrow generator, also known as RANLUX, is reimplemented as a linear congruential generator using large integer arithmetic with the modulus size of 576 bits to show a significant gain in generation speed. Expand
Review of High-Quality Random Number Generators
This paper outlines the Kolmogorov–Anosov theory of mixing in classical mechanical systems, and establishes criteria for deciding which RNG’s are sufficiently good approximations to the ideal mathematical systems that guarantee highest quality. Expand


A Review of Pseudorandom Number Generators
This is a brief review of the current situation concerning practical pseudorandom number generation for Monte Carlo calculations. The conclusion is that pseudorandom number generators with theExpand
Pseudorandom number generators for personal computers
The pseudorandom number generators that are provided by several popular PC Fortran compilers are tested and timed, and compared to two algorithms that were previously published in this journal. Expand
A portable high-quality random number generator for lattice field theory simulations
Abstract The theory underlying a proposed random number generator for numerical simulations in elementary particle physics and statistical mechanics is discussed. The generator is based on anExpand
Monte Carlo simulations: Hidden errors from "good" random number generators.
This work shows how the Wolff algorithm, now accepted as the best cluster-flipping Monte Carlo algorithm for beating ``critical slowing down,'' can yield incorrect answers due to subtle correlations in ``high quality'' random number generators. Expand