Optimal multipliers for linear congruential pseudo-random number generators with prime moduli: Parallel computation and properties
type: Item
instance of: scholarly article
title: Optimal multipliers for linear congruential pseudo-random number generators with prime moduli: Parallel computation and properties
zbMATH Open document ID: 0935.65001
DOI: 10.1023/A:1022333627834
author: K. Appert
published in: BIT
publication date: 2000-05-04T00:00:00Z
review text: The authors propose two search methods for multipliers for linear congruential pseudo-random number generators which are optimal with respect to an upper bound for the discrepancy of pairs of successive pseudo-random numbers. These search algorithms include search for primitive roots and fractions with small partial quotients in their continued fraction expansion. The efficiency of these search procedures when executed on parallel systems is assessed by experimental results of a MIMD parallel implementation on a Meiko CS-2 and a workstation cluster. The quality of the computed multipliers is evaluated by using the spectral test and by calculating the actual discrepancy of the resulting sequences.
Mathematics Subject Classification ID: 65C10
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1309449
zbMATH Keywords: parallel computation
zbMATH Keywords: linear congruential pseudo-random number generators
zbMATH Keywords: discrepancy
zbMATH Keywords: search algorithms
zbMATH Keywords: continued fraction expansion
zbMATH Keywords: spectral test
MaRDI profile type: Publication
full work available at URL: a:1022333627834
OpenAlex ID: W322602836
description: scientific article; zbMATH DE number 1309449