Pseudorandom number generators in empirical tests

被引:0
|
作者
Ostanin, A [1 ]
机构
[1] Bialystok Univ Technol, Dept Comp Sci, PL-15351 Bialystok, Poland
关键词
random number generator; simulation; statistical analysis; model testing; computational efficiency;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A reliable random number generator (RNG) is a basic and essential ingredient for any stochastic simulation. A single RNG is not always sufficient for Simulation. In many applications, several independent randorn numbers are required. Description and implementation of uniform combined multiple recursive generator is examined. We provide comparisons of the performance of some existing generators constructed as a grouping of two uniform combined multiple recursive generators (CMRG) and recommend the more promising one.
引用
收藏
页码:587 / 592
页数:6
相关论文
共 50 条
  • [21] Dynamic creation of pseudorandom number generators
    Matsumoto, M
    Nishimura, A
    MONTE CARLO AND QUASI-MONTE CARLO METHODS 1998, 2000, : 56 - 69
  • [22] ON A METHOD FOR COMPARISON OF PSEUDORANDOM NUMBER GENERATORS
    SEZGIN, F
    MICROELECTRONICS AND RELIABILITY, 1994, 34 (09): : 1557 - 1563
  • [23] Scrambled Linear Pseudorandom Number Generators
    Blackman, David
    Vigna, Sebastiano
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2021, 47 (04):
  • [24] Fast Splittable Pseudorandom Number Generators
    Steele, Guy L., Jr.
    Lea, Doug
    Flood, Christine H.
    ACM SIGPLAN NOTICES, 2014, 49 (10) : 453 - 472
  • [25] A METHOD FOR COMPARISON OF PSEUDORANDOM NUMBER GENERATORS
    BRKIC, DM
    MICROELECTRONICS RELIABILITY, 1992, 32 (04) : 453 - 455
  • [26] STOCHASTIC INVESTIGATIONS OF PSEUDORANDOM NUMBER GENERATORS
    UGRINSPARAC, G
    COMPUTING, 1991, 46 (01) : 53 - 65
  • [27] Cryptanalytic attacks on pseudorandom number generators
    Kelsey, J
    Schneier, B
    Wagner, D
    Hall, C
    FAST SOFTWARE ENCRYPTION, 1998, 1372 : 168 - 188
  • [28] Predicting nonlinear pseudorandom number generators
    Blackburn, SR
    Gomez-Perez, D
    Gutierrez, J
    Shparlinski, IE
    MATHEMATICS OF COMPUTATION, 2005, 74 (251) : 1471 - 1494
  • [29] ON OPTIMAL GFSR PSEUDORANDOM NUMBER GENERATORS
    TEZUKA, S
    MATHEMATICS OF COMPUTATION, 1988, 50 (182) : 531 - 533
  • [30] LOWER BOUNDS FOR PSEUDORANDOM NUMBER GENERATORS
    KHARITONOV, M
    GOLDBERG, AV
    YUNG, M
    30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 242 - 247