Adaptive Runtime Support for Direct Simulation Monte Carlo Methods on Distributed Memory Architectures
نویسندگان
چکیده
In highly adaptive irregular problems such as many Particle-In-Cell (PIC) codes and Direct Simulation Monte Carlo (DSMC) codes, data access patterns may vary from time step to time step. This uctuationmay hinder e cient utilization of distributed memory parallel computers because of the resulting overhead for data redistribution and dynamic load balancing. To e ciently parallelize such adaptive irregular problems on distributed memory parallel computers, several issues such as e ective methods for domain partitioning and fast data transportationmust be addressed. This paper presents e cient runtime support methods for such problems. A simple one-dimensional domain partitioning method is implemented and compared with unstructured mesh partitioners such as recursive coordinate bisection and recursive inertial bisection. A remapping decision policy has been investigated for dynamic load balancing on 3-dimensional DSMC codes. Performance results are presented.
منابع مشابه
Adaptive Runtime Support for Direct Simulation Monte Carlo Methods
In highly adaptive irregular problems such as many Particle-In-Cell (PIC) codes and Direct Simulation Monte Carlo (DSMC) codes, data access patterns may vary from time step to time step. This uctuation may hinder eecient utilization of distributed memory parallel computers because of the resulting overhead for data redistribution and dynamic load balancing. To eeciently parallelize such adap-ti...
متن کاملConcurrent DSMC Method Combining Variable Time-Step and Adaptive Unstructured Mesh
A parallel direct simulation Monte Carlo method is developed, which uses dynamic domain decomposition to solve the problem of load unbalancing among processors. In addition, variable time-step method and unstructured adaptive mesh are implemented, respectively, for reducing the computational time and increasing the accuracy of solution. Associated flow chart of the proposed DSMC method is illus...
متن کاملMC2MABS: A Monte Carlo Model Checker for Multiagent-Based Simulations
Agent-based simulation has shown great success for the study of complex adaptive systems and could in many areas show advantages over traditional analytical methods. Due to their internal complexity, however, agent-based simulations are notoriously difficult to verify and validate. This paper presents MCMABS, a Monte Carlo Model Checker for MultiagentBased Simulations. It incorporates the idea ...
متن کاملKinetic Monte Carlo Simulation of Oxalic Acid Ozonationover Lanthanum-based Perovskitesas Catalysts
Kinetic Monte Carlo simulation was applied to investigation of kinetics and mechanism of oxalic acid degradation by direct and heterogeneous catalytic ozonation. La-containing perovskites including LaFeO3, LaNiO3, LaCoO3 and LaMnO3 was studied as catalyst for oxalic acid ozonation. The reaction kinetic mechanisms of each abovementioned catalytic systems has been achieved. The rate constants val...
متن کاملMemory Bottlenecks and Memory Contention in Multi-Core Monte Carlo Transport Codes
Current and next generation processor designs require exploiting on-chip, fine-grained parallelism to achieve a significant fraction of theoretical peak CPU speed. The success or failure of these designs will have a tremendous impact on the performance and scaling of a number of key reactor physics algorithms run on next-generation computer architectures. One key example is the Monte Carlo (MC)...
متن کامل