Abstract | ||
---|---|---|
We present a parallel algorithm for Monte Carlo simulation of molecular beam epitaxial growth (MBE) focusing on the software we have developed and the experiences gained. An efficient sequential method to do MBE simulation was developed that uses a single binary tree to store the rates of occurrence of all possible events at a given time. The challenge was to find a way to adapt this method to a parallel machine. |
Year | DOI | Venue |
---|---|---|
1995 | 10.1109/IPPS.1995.395912 | IPPS |
Keywords | Field | DocType |
parallel monte carlo simulation,parallel algorithm,monte carlo simulation,single binary tree,possible event,parallel machine,mbe simulation,molecular beam epitaxial growth,efficient sequential method,mbe growth,random number generation,monte carlo methods,binary trees,parallel algorithms,atomic layer deposition,propulsion,binary tree,computer simulation,discrete event simulation,computational modeling | Monte Carlo method,Computer science,Parallel algorithm,Parallel computing,Binary tree,Kinetic Monte Carlo,Computational science,Software,Dynamic Monte Carlo method,Random number generation,Discrete event simulation | Conference |
ISBN | Citations | PageRank |
0-8186-7074-6 | 2 | 0.38 |
References | Authors | |
0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Beichl, Isabel | 1 | 63 | 22.58 |
Y. Ansel Teng | 2 | 26 | 4.83 |
James L. Blue | 3 | 60 | 243.30 |