Loading...
Please wait, while we are loading the content...
Similar Documents
SPRNG: A Scalable Library for Pseudorandom Number Generation (2000)
| Content Provider | CiteSeerX |
|---|---|
| Author | Mascagni, Michael Ceperley, David Srinivasan, Ashok |
| Abstract | Abstract. In this article we outline some methods for parallel pseudorandom number generation. We will focus on methods based on parameterization, meaning that we will not consider splitting methods. We describe parameterized versions of the following pseudorandom number generators: (i) linear congruential generators, (ii) shift-register generators, and (iii) lagged-Fibonacci generators. We brie y describe the methods, detail some advantages and disadvantages of each method and recount results from number theory that impact our understanding of their quality in parallel applications. Finally, we present a short description of a scalable library for pseudorandom number generation, called SPRNG. The description contained within this document ismeant only to outline the rationale behind and the capabilities of SPRNG. Much more information, including examples and detailed documentation aimed at helping users with putting and using SPRNG on scalable systems is available at the |
| File Format | |
| Volume Number | 26 |
| Journal | ACM Transactions on Mathematical Software |
| Language | English |
| Publisher Date | 2000-01-01 |
| Access Restriction | Open |
| Subject Keyword | Scalable Library Pseudorandom Number Generation Congruential Generator Scalable System Shift-register Generator Short Description Recount Result Number Theory Parameterized Version Following Pseudorandom Number Generator Detailed Documentation Parallel Application Parallel Pseudorandom Number Generation Lagged-fibonacci Generator |
| Content Type | Text |
| Resource Type | Article |