parallel random number generators
Recently Published Documents


TOTAL DOCUMENTS

14
(FIVE YEARS 0)

H-INDEX

6
(FIVE YEARS 0)

2019 ◽  
Vol 75 (7) ◽  
pp. 3866-3881
Author(s):  
Tadej Ciglarič ◽  
Rok Češnovar ◽  
Erik Štrumbelj

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
David H. K. Hoe ◽  
Jonathan M. Comer ◽  
Juan C. Cerda ◽  
Chris D. Martinez ◽  
Mukul V. Shirvaikar

Cellular computing represents a new paradigm for implementing high-speed massively parallel machines. Cellular automata (CA), which consist of an array of locally connected processing elements, are a basic form of a cellular-based architecture. The use of field programmable gate arrays (FPGAs) for implementing CA accelerators has shown promising results. This paper investigates the design of CA-based pseudo-random number generators (PRNGs) using an FPGA platform. To improve the quality of the random numbers that are generated, the basic CA structure is enhanced in two ways. First, the addition of a superrule to each CA cell is considered. The resulting self-programmable CA (SPCA) uses the superrule to determine when to make a dynamic rule change in each CA cell. The superrule takes its inputs from neighboring cells and can be considered itself a second CA working in parallel with the main CA. When implemented on an FPGA, the use of lookup tables in each logic cell removes any restrictions on how the super-rules should be defined. Second, a hybrid configuration is formed by combining a CA with a linear feedback shift register (LFSR). This is advantageous for FPGA designs due to the compactness of the LFSR implementations. A standard software package for statistically evaluating the quality of random number sequences known as Diehardis used to validate the results. Both the SPCA and the hybrid CA/LFSR were found to pass all the Diehardtests.


VLSI Design ◽  
2010 ◽  
Vol 2010 ◽  
pp. 1-11 ◽  
Author(s):  
JunKyu Lee ◽  
Gregory D. Peterson ◽  
Robert J. Harrison ◽  
Robert J. Hinde

The Scalable Parallel Random Number Generators (SPRNGs) library is widely used in computational science applications such as Monte Carlo simulations since SPRNG supports fast, parallel, and scalable random number generation with good statistical properties. In order to accelerate SPRNG, we develop a Hardware-Accelerated version of SPRNG (HASPRNG) on the Xilinx XC2VP50 Field Programmable Gate Arrays (FPGAs) in the Cray XD1 that produces identical results. HASPRNG includes the reconfigurable logic for FPGAs along with a programming interface which performs integer random number generation. To demonstrate HASPRNG for Reconfigurable Computing (RC) applications, we also develop a Monte Carlo π-estimator for the Cray XD1. The RC Monte Carlo π-estimator shows a 19.1× speedup over the 2.2 GHz AMD Opteron processor in the Cray XD1. In this paper we describe the FPGA implementation for HASPRNG and a π-estimator example application exploiting the fine-grained parallelism and mathematical properties of the SPRNG algorithm.


2009 ◽  
Vol 180 (12) ◽  
pp. 2574-2581 ◽  
Author(s):  
JunKyu Lee ◽  
Yu Bi ◽  
Gregory D. Peterson ◽  
Robert J. Hinde ◽  
Robert J. Harrison

2003 ◽  
Vol 29 (1) ◽  
pp. 69-94 ◽  
Author(s):  
Ashok Srinivasan ◽  
Michael Mascagni ◽  
David Ceperley

Sign in / Sign up

Export Citation Format

Share Document