{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/124386"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/124386","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Analyzing communication impacts of graph-refinement load-balancing in Stencil3D","abstract":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms","abstract_html":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms","abstract_has_math":false,"creators":["Yellapragada, Sowmya"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Kale, Laxmikant V"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024-05","date_published":"2024-05","updated_at":"2026-07-22T22:25:00Z","subjects":["Load Balancing","Graph Partioning Strategy","Parallel Programming","Charm++","Object Migration","Load Diffusion"],"languages":["en","eng"],"rights":["Copyright 2024 Sowmya Yellapragada"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/124386","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kale, Laxmikant V"]},{"key":"dc:creator","label":"Author","values":["Yellapragada, Sowmya"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2024-05","2024-04-29"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Load Balancing","Graph Partioning Strategy","Parallel Programming","Charm++","Object Migration","Load Diffusion"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en","eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2024 Sowmya Yellapragada"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/124386"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms","The student, Sowmya Yellapragada, accepted the attached license on 2024-04-23 at 16:16.","The student, Sowmya Yellapragada, submitted this Thesis for approval on 2024-04-23 at 16:37.","This Thesis was approved for publication on 2024-04-29 at 09:12.","DSpace SAF Submission Ingestion Package generated from Vireo submission #20591 on 2024-09-16 at 00:36:03","Load balancing is a critical aspect of parallel and distributed computing systems, especially in environments characterized by dynamic workloads and high communication volumes. In this thesis, we delve into various load-balancing strategies for Charm++ applications, with a specific focus on communication-aware methods. Our goal is to maximize internal communication and minimize external communication across the nodes. We analyze two primary load-balancing algorithms - GreedyRefineLB and GraphRefineLB. Graph-based partitioning strategies aim to optimize load distribution by considering the communication topology. These algorithms leverage graph partitioning techniques to achieve better load balance. However, they also face challenges related to scalability and adaptability to changing workloads. Our major contribution lies in analyzing the communication impacts of a new algorithm: Communication-aware Diffusion LB. This innovative approach seeks to strike a balance between two critical objectives - reducing object migrations and enhancing communication locality. To assess the efficacy of these strategies, we employ the Stencil3d benchmark—a well-established synthetic standard for evaluating parallel and distributed systems. Our evaluation reveals the trade-offs associated with different load-balancing approaches. Notably, Communication-aware Diffusion LB demonstrates superior performance in managing dynamic workloads with substantial communication requirements. In summary, our research underscores the importance of communication-aware load balancing in parallel computing environments. As applications continue to evolve, finding the right balance between communication optimization and efficient system utilization remains crucial. The Communication-aware Diffusion LB offers a promising avenue for achieving this balance and enhancing the overall performance of Charm++ applications."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Analyzing communication impacts of graph-refinement load-balancing in Stencil3D"]}]}],"canonical_facts":{"dc:contributor":["Kale, Laxmikant V"],"dc:creator":["Yellapragada, Sowmya"],"dc:date":["2024-05","2024-04-29"],"dc:description":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms","The student, Sowmya Yellapragada, accepted the attached license on 2024-04-23 at 16:16.","The student, Sowmya Yellapragada, submitted this Thesis for approval on 2024-04-23 at 16:37.","This Thesis was approved for publication on 2024-04-29 at 09:12.","DSpace SAF Submission Ingestion Package generated from Vireo submission #20591 on 2024-09-16 at 00:36:03","Load balancing is a critical aspect of parallel and distributed computing systems, especially in environments characterized by dynamic workloads and high communication volumes. In this thesis, we delve into various load-balancing strategies for Charm++ applications, with a specific focus on communication-aware methods. Our goal is to maximize internal communication and minimize external communication across the nodes. We analyze two primary load-balancing algorithms - GreedyRefineLB and GraphRefineLB. Graph-based partitioning strategies aim to optimize load distribution by considering the communication topology. These algorithms leverage graph partitioning techniques to achieve better load balance. However, they also face challenges related to scalability and adaptability to changing workloads. Our major contribution lies in analyzing the communication impacts of a new algorithm: Communication-aware Diffusion LB. This innovative approach seeks to strike a balance between two critical objectives - reducing object migrations and enhancing communication locality. To assess the efficacy of these strategies, we employ the Stencil3d benchmark—a well-established synthetic standard for evaluating parallel and distributed systems. Our evaluation reveals the trade-offs associated with different load-balancing approaches. Notably, Communication-aware Diffusion LB demonstrates superior performance in managing dynamic workloads with substantial communication requirements. In summary, our research underscores the importance of communication-aware load balancing in parallel computing environments. As applications continue to evolve, finding the right balance between communication optimization and efficient system utilization remains crucial. The Communication-aware Diffusion LB offers a promising avenue for achieving this balance and enhancing the overall performance of Charm++ applications."],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/124386"],"dc:language":["en","eng"],"dc:rights":["Copyright 2024 Sowmya Yellapragada"],"dc:subject":["Load Balancing","Graph Partioning Strategy","Parallel Programming","Charm++","Object Migration","Load Diffusion"],"dc:title":["Analyzing communication impacts of graph-refinement load-balancing in Stencil3D"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:00Z"}