1990•Conference on High Performance Computing (Supercomputing)Requires access

A vectorized long-period shift-register random number generator

Salvatore Filippone, Paolo Santangelo, Marcello Vitaletti

Open publisher page 0 citations

Abstract

A pseudo-random number generator, based on a linear-feedback shift-register sequence, is presented. The very long period of the generator, 21279 — 1, makes it useful in modern statistical simulations where the shorter period of other generators could either be exhausted during a single run or determine departures from uniform randomness when generating positions in a multidimensional space. In particular, the proposed generator overcomes the limitations of multiplicative-congruential generators with modulus 231 — 1, which are widely used on computers with a 32-bit integer word size, such as the IBM S/370 family of computers.

About this research paper

What this paper is about

A pseudo-random number generator, based on a linear-feedback shift-register sequence, is presented. The very long period of the generator, 21279 — 1, makes it useful in modern statistical simulations where the shorter period of other generators could either be exhausted during a single run or determine departures from uniform randomness when generating positions in a multidimensional space. In particular, the proposed generator overcomes the limitations of multiplicative-congruential generators with modulus 231 — 1, which are widely used on computers with a 32-bit integer word size, such as the IBM S/370 family of computers.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A pseudo-random number generator, based on a linear-feedback shift-register sequence, is presented. The very long period of the generator, 21279 — 1, makes it useful in modern statistical simulations where the shorter period of other generators could either be exhausted during a single run or determine departures from uniform randomness when generating positions in a multidimensional space. In particular, the proposed generator overcomes the limitations of multiplicative-congruential generators with modulus 231 — 1, which are widely used on computers with a 32-bit integer word size, such as the IBM S/370 family of computers.

Key concepts: Shift register, Random number generation, Linear congruential generator, Pseudorandom number generator, Randomness, Generator (circuit theory), Computer science, Multiplicative function

Related papers

Back to paper searchBrowse research topicsOriginal source
A vectorized long-period shift-register random number generator — Research Paper | ScholarLens