Show simple item record

Adaptive Runtime Support for Direct Simulation Monte Carlo Methods on Distributed Memory Architectures

dc.contributor.authorMoon, Bongkien_US
dc.contributor.authorSaltz, Joelen_US
dc.description.abstractIn highly adaptive irregular problems such as many Particle-In-Cell (PICJ codes and Dimet Simulation Monte Carlo (DSMCJ codes, data access patterns may vary from time step to time step. This fluctuation may hinder efficient utilization of distributed memory parallel computers because of the resulting overhead for data redistribution and dynamic load balancing. To efficiently parallelize such adaptive irregular problems on distributed memory parallel computers, several issues such as effective methods for domain partitioning and fast data transportation must be addressed. This paper presents efficient 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 S-dimensional DSMC codes. Performance results are presented (Also cross-referenced as UMIACS-TR-95-27)en_US
dc.format.extent1634161 bytes
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3427en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-95-27en_US
dc.titleAdaptive Runtime Support for Direct Simulation Monte Carlo Methods on Distributed Memory Architecturesen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record