2026-09-20T17:20:53Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/31216 2023-07-10 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Kale, Laxmikant V. Gopalakrishnan Menon, Harshitha Menon 2012-05-22T00:36:10Z 2012-05-22T00:36:10Z 2012-05 2012-05-22T00:36:10Z 2012-05 With the dawn of petascale, and with exascale in the near future, it has become significantly difficult to write parallel applications that fully exploit the processing power, and scale to large systems. Load imbalance, both computationally and communication induced, presents itself as one of the important challenges in achieving scalability and high performance. Problem sizes and system sizes have become so large that manually handling the imbalance in dynamic applications, and finding an optimum distribution of load has become a herculean task. Charm++~\cite provides the user with a run time system that performs dynamic load balancing. To enable Charm++ to perform load balancing in an efficient manner, the user takes certain decisions such as when to load balance and which strategy to use, and informs the Charm++ run-time system of these decisions. Many a times, taking these important decisions involve hand tuning each application by observing various runs of the application. In this thesis, a Meta-Balancer which relieves the user from the effort of making the load balancing related decisions, is presented. The Meta-Balancer is a part of the Charm++ load balancing framework. It identifies the characteristics of the application, and based on the principle of persistence and the accrued information, makes load balancing related decisions. We study the performance of the Meta-Balancer in the context of leanmd mini application. We also evaluate the Meta-Balancer in the context of micro benchmarks such as kNeighbor and jacobi2D. We also present several new load balancing strategies, that have been incorporated into Charm++, and study their impact on the performance of applications. These new strategies are: 1)RefineSwapLB, which is a refinement based load balancing strategy, 2)CommAwareRefineLB, which is a communication aware refinement strategy, 3)ScotchRefineLB, which is a refinement based graph partitioning strategy using Scotch, a graph partitioner, and 4) ZoltanLB, which is a multicast aware load balancing strategy using Zoltan, a hypergraph partitioner. Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-04-26T18:39:23Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 HarshithaMenon_GopalakrishnanMenon.pdf: 465208 bytes, checksum: 877d25bafc3828c410945f03aa74abc8 (MD5) Made available in DSpace on 2012-05-22T00:36:10Z (GMT). No. of bitstreams: 2 HarshithaMenon_GopalakrishnanMenon.pdf: 465208 bytes, checksum: 877d25bafc3828c410945f03aa74abc8 (MD5) license.txt: 4074 bytes, checksum: d38c5b47ad04d78f319a61a6b8fcc67f (MD5) http://hdl.handle.net/2142/31216 en Copyright 2012 Harshitha Menon Gopalakrishnan Menon Load Balancing Charm++ Meta-Balancer Meta-Balancer: automated load balancing based on application behavior text Computer Science 1434 Computer Science 0112 University of Illinois at Urbana-Champaign Thesis M.S. MS:Computer Science -UIUC 10KS0112MS