We show that the latest version of massively parallel processing associative string processing architecture (System-V) is applicable for fast Monte Carlo simulation if an effective on-processor random number generator is implemented. Our lagged Fibonacci generator can produce $10^8$ random numbers on a processor string of 12K PE-s. The time dependent Monte Carlo algorithm of the one-dimensional non-equilibrium kinetic Ising model performs 80 faster than the corresponding serial algorithm on a 300 MHz UltraSparc
The work considers the multiprocessors technologies of modeling for Monte Carlo tasks. It is shown t...
Abstract. We argue that Monte Carlo algorithms are ideally suited to parallel computing, and that “p...
Mersenne Twister (MT) uniform random number generators are key cores for hardware acceleration of Mo...
We present a case study on the utility of graphics cards to perform massively parallel simulation of...
The future of high-performance computing is aligning itself towards the efficient use of highly para...
We present a case-study on the utility of graphics cards to perform massively parallel simulation of...
Monte carlo simulation is one of the techniques used to generate pseudorandomnumbers which can compr...
We present a case-study on the utility of graphics cards to perform massively parallel sim ulation w...
Powerful compute clusters and multi-core systems have become widely available in research and indust...
International audienceIn this paper, we present some investigations on the parallelization of stocha...
We will look at random number generation from the point-of-view of Monte Carlo computations. Thus...
A signi cant problem faced by scienti c investigation of complex modern systems is that credible sim...
The associative memory (AM) system is a computing device made of hundreds of AM ASICs chips designed...
The reproducibility of numerical experiments on high performance computing systems is sometimes over...
Efficient random number generation with high quality statistical properties and exact reproducibilit...
The work considers the multiprocessors technologies of modeling for Monte Carlo tasks. It is shown t...
Abstract. We argue that Monte Carlo algorithms are ideally suited to parallel computing, and that “p...
Mersenne Twister (MT) uniform random number generators are key cores for hardware acceleration of Mo...
We present a case study on the utility of graphics cards to perform massively parallel simulation of...
The future of high-performance computing is aligning itself towards the efficient use of highly para...
We present a case-study on the utility of graphics cards to perform massively parallel simulation of...
Monte carlo simulation is one of the techniques used to generate pseudorandomnumbers which can compr...
We present a case-study on the utility of graphics cards to perform massively parallel sim ulation w...
Powerful compute clusters and multi-core systems have become widely available in research and indust...
International audienceIn this paper, we present some investigations on the parallelization of stocha...
We will look at random number generation from the point-of-view of Monte Carlo computations. Thus...
A signi cant problem faced by scienti c investigation of complex modern systems is that credible sim...
The associative memory (AM) system is a computing device made of hundreds of AM ASICs chips designed...
The reproducibility of numerical experiments on high performance computing systems is sometimes over...
Efficient random number generation with high quality statistical properties and exact reproducibilit...
The work considers the multiprocessors technologies of modeling for Monte Carlo tasks. It is shown t...
Abstract. We argue that Monte Carlo algorithms are ideally suited to parallel computing, and that “p...
Mersenne Twister (MT) uniform random number generators are key cores for hardware acceleration of Mo...