Parallel Pseudorandom Number Generation Using Additive Lagged-Fibonacci Recursions

. We study the suitability of the additive lagged-Fibonacci pseudorandom numbergenerator for parallel computation. This generator has a relatively short period withrespect to the size of its seed. However, the short period is more than made up for withthe huge number of full-period cycles it contains. We call these different full-period cyclesequivalence classes. We show how to enumerate the equivalence classes and how to computeseeds to select a given equivalence class. The use of these...