Abstract
Presents the design and preliminary evaluation of hierarchical partitioning and load-balancing techniques for distributed structured adaptive mesh refinement (SAMR) applications. The overall goal of these techniques is to enable the load distribution to reflect the state of the adaptive grid hierarchy and exploit it to reduce synchronization requirements, improve load-balance, and enable concurrent communications and incremental redistribution. The hierarchical partitioning algorithm (HPA) partitions the computational domain into subdomains and assigns them to hierarchical processor groups. Two variants of HPA are presented. The static hierarchical partitioning algorithm (SHRA) assigns portions of overall load to processor groups. In SHRA, the group size and the number of processors in each group is setup during initialization and remains unchanged during application execution. It is experimentally shown that SHRA reduces communication costs as compared to the Non-HPA scheme, and reduces overall application execution time by up to 41%. The adaptive hierarchical partitioning algorithm (AHRA) dynamically partitions the processor pool into hierarchical groups that match the structure of the adaptive grid hierarchy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
