Computer Science B. Tech., Indian Institute of Technology, Kanpur, 2005
2007 Professor Laxmikant V. Kalé
In this thesis, we examine how topological considerations in mapping and load balancing algorithms can help communication and make applications faster. To present concrete results, several applications written in CHARM++, 7-point 3-dimensional Stencil, NAMD and LEANCP are considered. Results on 7-point Stencil are presented as a proof of principle because it is a relatively simple to analyze and map. NAMD and LEANCP on the other hand are production codes with thousands of users. NAMD is a classical molecular dynamics application and heavily depends on load balancing for optimal performance. Load balancers deployed in NAMD have been modified to place communicating objects in proximity to one another by considering the communication in multicasts. LEANCP is a quantum chemistry application based on the Car-Parrinello ab-initio Molecular Dynamics (CPAIMD) method. In LEANCP, the default mapping of its several object arrays to processors by the CHARM++ runtime has been modified to optimize communication. Results of improvements from these strategies are demonstrated for all these applications on IBM's Blue Gene/L and Cray's XT3.