Efficient Jump Ahead for 𝔽2-Linear Random Number Generators

DOI10.1287/ijoc.1070.0251zbMath1243.65006OpenAlexW2123577276MaRDI QIDQ2901021

Makoto Matsumoto, Pierre L'Ecuyer, Takuji Nishimura, Francois Panneton, Hiroshi Haramoto

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1070.0251

zbMATH Keywords

simulationrandom number generationmultiple streamsjumping ahead

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Random number generation in numerical analysis (65C10)

Related Items (5)

Random number generators for large-scale parallel Monte Carlo simulations on FPGA ⋮ Random numbers for parallel computers: requirements and methods, with emphasis on gpus ⋮ Toppling and height probabilities in sandpiles ⋮ Using rngstreams for parallel random number generation in C++ and R ⋮ A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space

Uses Software

• MersenneTwister
• RngSteam

This page was built for publication: Efficient Jump Ahead for 𝔽₂-Linear Random Number Generators