On the xorshift random number generators

DOI10.1145/1113316.1113319zbMath1390.65015OpenAlexW2010523529WikidataQ60395588 ScholiaQ60395588MaRDI QIDQ4565360

Francois Panneton, Pierre L'Ecuyer

Publication date: 12 June 2018

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1113316.1113319

zbMATH Keywords

random number generationlinear feedback shift registerlinear recurrence modulo 2xorshift

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Related Items (10)

A search for good pseudo-random number generators: survey and empirical studies ⋮ A practical approach to testing random number generators in computer algebra systems ⋮ xorshift1024*, xorshift1024+, xorshift128+ and xoroshiro128+ fail statistical tests for linearity ⋮ A modular extension for a computer algebra system ⋮ Random numbers for parallel computers: requirements and methods, with emphasis on gpus ⋮ Unveiling patterns in xorshift128+ pseudorandom number generators ⋮ Pseudo-random number generators for Monte Carlo simulations on ATI graphics processing units ⋮ Resolution-stationary random number generators ⋮ Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation ⋮ Further scramblings of Marsaglia's \(\mathsf{xorshift}\) generators

This page was built for publication: On the xorshift random number generators