18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.
DOI: 10.1109/ipdps.2004.1303143
|View full text |Cite
|
Sign up to set email alerts
|

JAPARA - a Java parallel random number generator library for high-performance computing

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 10 publications
0
13
0
Order By: Relevance
“…In this context, since each thread has its own private data (not each core), the threads can be seen as (logical) PEs [64,67], and it appears more relevant to have one stream per thread rather than one stream per physical PE. This is done for example in JAPARA [9], in which a synchronized method in a central monitor computes (sequentially) the seeds of the different streams and assigns them to the threads, using a splitting technique as in [45,46]. Once the thread gets its seed, it can evolves independently; there is no further need for the central monitor.…”
Section: How To Produce Parallel Streams and Substreamsmentioning
confidence: 99%
“…In this context, since each thread has its own private data (not each core), the threads can be seen as (logical) PEs [64,67], and it appears more relevant to have one stream per thread rather than one stream per physical PE. This is done for example in JAPARA [9], in which a synchronized method in a central monitor computes (sequentially) the seeds of the different streams and assigns them to the threads, using a splitting technique as in [45,46]. Once the thread gets its seed, it can evolves independently; there is no further need for the central monitor.…”
Section: How To Produce Parallel Streams and Substreamsmentioning
confidence: 99%
“…L'Ecuyer and his team proposed a package able to produce many long streams and substreams in C, C++, Java, and FORTRAN [12] and also in R in a later version. Coddington and Newell proposed the JaPara library (a Java Parallel Random Number Library) for High-Performance Computing [25]. If we consider Java, our advice would be to use the SSJ package, still from L'Ecuyer's team.…”
Section: E Software Aid For the Distribution Of Random Streamsmentioning
confidence: 99%
“…This approach is the natural one but doesn't fulfill the requirements for a good parallel RNG [18] and creates a bottleneck that slows down the distributed simulation. The "sequence splitting" or "blocking" consists in splitting the RNG cycle into non-overlapping contiguous sections [19]. This Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.…”
Section: Parallelization Of Prngmentioning
confidence: 99%
“…This technique is available for a few generators like some lagged Fibonacci pseudo-random number generators. [19]. This last technique is close to the "parameterization" technique that might be used with some RNG like the Mersenne Twister [16] or linear congruential generator with Mersenne or Sophie-Germain prime moduli [21].…”
Section: Parallelization Of Prngmentioning
confidence: 99%