Quasi-random Number Generation in the View of Parallel Implementation
نویسنده
چکیده
Pseudo-random number sequences have been used in Monte Carlo methods in wide areas of science and engineer. Recently, quasi-random number sequences having uniform distribution property are used in numerical integrations, particle transport problems, financial problems and so on. Here, I survey on the quasi-random number generation and its applications. At the end, I discuss about the possible implementation of parallel quasi-random number generation.
منابع مشابه
نقش اعداد تصادفی در شبیه سازی و بررسی تحلیلی الگوریتمهای تولید اعداد تصادفی و ارائه روش تلفیقی جدید
Abstract: Analyzing different issues of most systems, particularly their design, implementation, and development, requires some sort of techniques which are capable of studying their special conditions in stochastic states. Simulation is regarded as one of the most efficient methods for this purpose in the area of engineering, systems, and management. Studying and analyzing a system under spe...
متن کاملA Parallelized Quasi-monte Carlo Algorithm for the Extraction of Partial Inductances in Ic Interconnect Structures
This paper presents a parallelized Quasi-Monte Carlo algorithm for the extraction of partial inductances in IC interconnect structures. Quasi-random numbers provide superior convergence over pseudo-random numbers, and in this paper the results are presented for three quasi-random number sequences-Halton, Sobol and Niderreiter. The algorithm has been parallelized and an almost linear rate of par...
متن کاملHardware Implementation of Dynamic S-BOX to Use in AES Cryptosystem
One of the major cipher symmetric algorithms is AES. Its main feature is to use S-BOX step, which is the only non-linear part of this standard possessing fixed structure. During the previous studies, it was shown that AES standard security was increased by changing the design concepts of S-BOX and production of dynamic S-BOX. In this paper, a change of AES standard security is studied by produc...
متن کاملParallel Computation of Optimal Parameters for Pseudo Random Number Generation
Two systematic search methods are employed to nd mul-tipliers for linear congruential pseudo-random number generation which are optimal with respect to the discrepancy of pairs of successive pseudo-random numbers. These two methods are compared in terms of their suitability for parallel computation. Experimental results of a MIMD workstationcluster{implementation and an evaluation of the calcul...
متن کاملParallel Implementation of Particle Swarm Optimization Variants Using Graphics Processing Unit Platform
There are different variants of Particle Swarm Optimization (PSO) algorithm such as Adaptive Particle Swarm Optimization (APSO) and Particle Swarm Optimization with an Aging Leader and Challengers (ALC-PSO). These algorithms improve the performance of PSO in terms of finding the best solution and accelerating the convergence speed. However, these algorithms are computationally intensive. The go...
متن کامل