A RANDOM NUMBER GENERATOR FOR PARALLEL COMPUTERS

被引：12

作者：

ALURU, S ^{[1
]}

PRABHU, GM ^{[1
]}

GUSTAFSON, J ^{[1
]}

机构：

[1] IOWA STATE UNIV SCI & TECHNOL,DEPT COMP SCI,AMES,IA 50011

来源：

PARALLEL COMPUTING | 1992年 / 18卷 / 08期

关键词：

PARALLEL RANDOM NUMBER GENERATOR; GFSR ALGORITHM; PRIMITIVE TRINOMIAL; LEAPFROG TECHNIQUE;

D O I：

10.1016/0167-8191(92)90030-B

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Running huge simulational computations on a system of parallel processors requires the generation of uniform random sequences on each processor. Various techniques useful for the generation of parallel random sequences are analyzed for their suitability to parallel architectures. An efficient parallelization of the Generalized Feedback Shift Register (GFSR) algorithm for generating pseudorandom numbers is presented. The algorithm works on any parallel computer where the number of processors is a power of two and requires the same amount of memory per processor as required by the sequential GFSR algorithm.

引用

页码：839 / 847

页数：9

共 21 条

[1] RANDOM NUMBER GENERATORS ON VECTOR SUPERCOMPUTERS AND OTHER ADVANCED ARCHITECTURES [J].

ANDERSON, SL .

SIAM REVIEW, 1990, 32 (02) :221-251

[2]

Bailey D., 1991, RNR91002 NASA AM RES

[3]

BOWMAN KO, 1987, HYPERCUBE MULTIPROCE, P445

[4] INITIALIZING GENERALIZED FEEDBACK SHIFT REGISTER PSEUDORANDOM NUMBER GENERATORS [J].

COLLINGS, BJ ;

HEMBREE, GB .

JOURNAL OF THE ACM, 1986, 33 (04) :706-711

[5] UNIFORM RANDOM NUMBER GENERATORS FOR PARALLEL COMPUTERS [J].

DEAK, I .

PARALLEL COMPUTING, 1990, 15 (1-3) :155-164

[6]

EVANS W, 1989, 4TH P C HYP CONC COM, V1, P415

[7]

FOX, 1988, SOLVING PROBLEMS CON, V1

[8]

Golomb S., 1982, SHIFT REGISTER SEQUE

[9]

Knuth D.E., 1981, ART COMPUTER PROGRAM, V2

[10] GENERALIZED FEEDBACK SHIFT REGISTER PSEUDORANDOM NUMBER ALGORITHM [J].

LEWIS, TG ;

PAYNE, WH .

JOURNAL OF THE ACM, 1973, 20 (03) :456-468

← 1 2 3 →