1988
DOI: 10.1016/0167-8191(88)90112-3
|View full text |Cite
|
Sign up to set email alerts
|

Tradeoffs in granularity and parallelization for a Monte Carlo shower simulation code

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

1990
1990
1999
1999

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 3 publications
0
4
0
Order By: Relevance
“…In a review of vectorized Monte Carlo, Martin and Brown 281 described variations of event-based algorithms together with speed-up results published by different groups. During the last two decades, investigations were carried out to run different Monte Carlo codes on multipletransputer systems, 282,283 vector parallel supercomputers, 266,267,284,285 parallel computers 38,286,287 and a cluster of workstations in a local area network using PVM. 288 There are large discrepancies in the performance ratio reported by different authors.…”
Section: ͑I͒mentioning
confidence: 99%
“…In a review of vectorized Monte Carlo, Martin and Brown 281 described variations of event-based algorithms together with speed-up results published by different groups. During the last two decades, investigations were carried out to run different Monte Carlo codes on multipletransputer systems, 282,283 vector parallel supercomputers, 266,267,284,285 parallel computers 38,286,287 and a cluster of workstations in a local area network using PVM. 288 There are large discrepancies in the performance ratio reported by different authors.…”
Section: ͑I͒mentioning
confidence: 99%
“…Whilst this does not absolutely guarantee that the number streams for each program are independent from another, it is highly probable, as only a small fraction of the total period of the random number generator is used. We intend implementing a method (Miura and Babb 1987) to guarantee this for certain.…”
Section: Methodsmentioning
confidence: 99%
“…A multiple-processor computer can be used, or more than one separate computer, as long is care is taken that the random numbers used are independent (Press et al 1992), so each processor does not end up simulating the same data. Miura and Babb (1987) discuss how to do this for programs that use multiple processors.…”
Section: Introductionmentioning
confidence: 99%
“…Researchers have expended considerable effort to take advantage of parallel architectures on a variety of codes that fall under the general heading of Monte Carlo trajectory simulations [Martin 1988;Miura and Babb 1988;Frederickson et al 1987], often with very good results. Our initial interest in this work was sparked by knowledge of these efforts and from two additional factors: (1) We were users of a state-of-the-art serial AEM simulation code developed by researchers at the National Institute for Standards and Technology (NIST) [Newbury and Myklebust 1981], but were limited in the size of problems it could tackle, and (2) we have access to parallel supercomputers (nCUBE and Intel machines) that seemed ideal for speeding up these kinds of computations.…”
Section: Introductionmentioning
confidence: 99%