{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/129286"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/129286","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Adaptive runtime techniques for node-aware resource optimization","abstract":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms","abstract_html":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms","abstract_has_math":false,"creators":["Chandrasekar, Kavitha"],"institution":"University of Illinois Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Kale, Laxmikant","Torrellas, Josep","Amato, Nancy","Rountree, Barry"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025-04-30","date_published":"2025-04-30","updated_at":"2026-07-22T22:25:04Z","subjects":["High Performance Computing","Node-aware resource tuning","Message aggregation","Load balancing"],"languages":["en","eng"],"rights":["Copyright 2025 Kavitha Chandrasekar"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/129286","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kale, Laxmikant","Torrellas, Josep","Amato, Nancy","Rountree, Barry"]},{"key":"dc:creator","label":"Author","values":["Chandrasekar, Kavitha"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2025-04-30","2025-05"]},{"key":"dc:type","label":"Dc Type","values":["text","Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["High Performance Computing","Node-aware resource tuning","Message aggregation","Load balancing"]}]},{"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 2025 Kavitha Chandrasekar"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/129286"]}]},{"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 2025-10-19 without embargo terms","The student, Kavitha Chandrasekar, accepted the attached license on 2025-04-30 at 08:47.","The student, Kavitha Chandrasekar, submitted this Dissertation for approval on 2025-04-30 at 09:02.","This Dissertation was approved for publication on 2025-04-30 at 15:22.","DSpace SAF Submission Ingestion Package generated from Vireo submission #22107 on 2025-10-19 at 18:11:22","Adaptive runtime systems have to deal with an increasing number of cores per node. Adaptive algorithms that worked well when the number of cores per node was smaller now run into many challenges. This dissertation is aimed at addressing these challenges along multiple frontiers. The first challenge is simply about how many cores on each node to utilize for a given application. We analyzed this issue from the point of view of performance as well as energy saving, and demonstrate adaptive runtime techniques for tuning the number of cores used during execution. Secondly, many of the issues discussed here are meaningful mainly when one is using a shared-memory process spanning multiple cores of a node, rather than a \"Charm++ everywhere\" (analogous to MPI everywhere) mode, where each process runs on a core of its own. The latter is fundamentally sub-optimal, because it precludes resource and data-structure sharing. However, the former suffers from performance issues, especially in communication, because it is harder to expose and exploit parallelism in the network interface usage. We address this issue with comprehensive analysis and communication layer design driven by such analysis to demonstrate on-par communication performance and/or identify additional issues that need to be dealt with. Thirdly, adaptive runtime systems often have to deal with fine-grained communication. This necessitates adaptive aggregation of many short messages. However, large multicore nodes complicate this aggregation functionality, along with the diverse needs of applications. We develop metrics for characterizing the use-cases, and develop adaptive algorithms that work well on multicore nodes and for varied use cases. Fourthly, dynamic load balancing is another challenge: migrating work units to cores to effectively balance load in dynamic applications needs to take into account the multi-level nature of communication, while also addressing scalability issues created by the huge number of cores on modern machines. We demonstrate node aware, and communication aware strategies, including refinement strategies that aim at minimal migration and low load balancing overhead."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Adaptive runtime techniques for node-aware resource optimization"]}]}],"canonical_facts":{"dc:contributor":["Kale, Laxmikant","Torrellas, Josep","Amato, Nancy","Rountree, Barry"],"dc:creator":["Chandrasekar, Kavitha"],"dc:date":["2025-04-30","2025-05"],"dc:description":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms","The student, Kavitha Chandrasekar, accepted the attached license on 2025-04-30 at 08:47.","The student, Kavitha Chandrasekar, submitted this Dissertation for approval on 2025-04-30 at 09:02.","This Dissertation was approved for publication on 2025-04-30 at 15:22.","DSpace SAF Submission Ingestion Package generated from Vireo submission #22107 on 2025-10-19 at 18:11:22","Adaptive runtime systems have to deal with an increasing number of cores per node. Adaptive algorithms that worked well when the number of cores per node was smaller now run into many challenges. This dissertation is aimed at addressing these challenges along multiple frontiers. The first challenge is simply about how many cores on each node to utilize for a given application. We analyzed this issue from the point of view of performance as well as energy saving, and demonstrate adaptive runtime techniques for tuning the number of cores used during execution. Secondly, many of the issues discussed here are meaningful mainly when one is using a shared-memory process spanning multiple cores of a node, rather than a \"Charm++ everywhere\" (analogous to MPI everywhere) mode, where each process runs on a core of its own. The latter is fundamentally sub-optimal, because it precludes resource and data-structure sharing. However, the former suffers from performance issues, especially in communication, because it is harder to expose and exploit parallelism in the network interface usage. We address this issue with comprehensive analysis and communication layer design driven by such analysis to demonstrate on-par communication performance and/or identify additional issues that need to be dealt with. Thirdly, adaptive runtime systems often have to deal with fine-grained communication. This necessitates adaptive aggregation of many short messages. However, large multicore nodes complicate this aggregation functionality, along with the diverse needs of applications. We develop metrics for characterizing the use-cases, and develop adaptive algorithms that work well on multicore nodes and for varied use cases. Fourthly, dynamic load balancing is another challenge: migrating work units to cores to effectively balance load in dynamic applications needs to take into account the multi-level nature of communication, while also addressing scalability issues created by the huge number of cores on modern machines. We demonstrate node aware, and communication aware strategies, including refinement strategies that aim at minimal migration and low load balancing overhead."],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/129286"],"dc:language":["en","eng"],"dc:rights":["Copyright 2025 Kavitha Chandrasekar"],"dc:subject":["High Performance Computing","Node-aware resource tuning","Message aggregation","Load balancing"],"dc:title":["Adaptive runtime techniques for node-aware resource optimization"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:04Z"}