On the Performance of Malleable APGAS Programs and Batch Job Schedulers
| dc.date.accessioned | 2024-04-12T11:16:54Z | |
| dc.date.available | 2024-04-12T11:16:54Z | |
| dc.date.issued | 2024-01-18 | |
| dc.identifier | doi:10.17170/kobra-202404109953 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/15657 | |
| dc.description.sponsorship | Gefördert im Rahmen des Projekts DEAL | |
| dc.language.iso | eng | |
| dc.rights | Namensnennung 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | * |
| dc.subject | Malleable runtime system | eng |
| dc.subject | Malleable job scheduling | eng |
| dc.subject | APGAS Introduction | eng |
| dc.subject.ddc | 004 | |
| dc.title | On the Performance of Malleable APGAS Programs and Batch Job Schedulers | eng |
| dc.type | Aufsatz | |
| dcterms.abstract | Malleability—the ability for applications to dynamically adjust their resource allocations at runtime—presents great potential to enhance the efficiency and resource utilization of modern supercomputers. However, applications are rarely capable of growing and shrinking their number of nodes at runtime, and batch job schedulers provide only rudimentary support for such features. While numerous approaches have been proposed to enable application malleability, these typically focus on iterative computations and require complex code modifications. This amplifies the challenges for programmers, who already wrestle with the complexity of traditional MPI inter-node programming. Asynchronous Many-Task (AMT) programming presents a promising alternative. In AMT, computations are split into many fine-grained tasks, which are processed by workers. This makes transparent task relocation via the AMT runtime system possible, thus offering great potential for enabling efficient malleability. In this work, we propose an extension to an existing AMT system, namely APGAS for Java. We provide easyto-use malleability programming abstractions, requiring only minor application code additions from programmers. Runtime adjustments, such as process initialization and termination, are automatically managed by our malleability extension. We validate our malleability extension by adapting a load balancing library handling multiple benchmarks. We show that both shrinking and growing operations cost low execution time overhead. In addition, we demonstrate compatibility with potential batch job schedulers by developing a prototype batch job scheduler that supports malleable jobs. Through extensive realworld job batches execution on up to 32 nodes, involving rigid, moldable, and malleable programs, we evaluate the impact of deploying malleable APGAS applications on supercomputers. Exploiting scheduling algorithms, such as FCFS, Backfilling, Easy-Backfilling, and one exploiting malleable jobs, the experimental results highlight a significant improvement regarding several metrics for malleable jobs. We show a 13.09% makespan reduction (the time needed to schedule and execute all jobs), a 19.86% increase in node utilization, and a 3.61% decrease in job turnaround time (the time a job takes from its submission to completion) when using 100% malleable job in combination with our prototype batch job scheduler compared to the bestperforming scheduling algorithm with 100% rigid jobs. | eng |
| dcterms.accessRights | open access | |
| dcterms.creator | Finnerty, Patrick | |
| dcterms.creator | Posner, Jonas | |
| dcterms.creator | Bürger, Janek | |
| dcterms.creator | Takaoka, Leo | |
| dcterms.creator | Kanzaki, Takuma | |
| dc.relation.doi | doi:10.1007/s42979-024-02641-7 | |
| dc.subject.swd | Arbeitsplanung | ger |
| dc.subject.swd | Formänderungsvermögen | ger |
| dc.subject.swd | Flexibilität | ger |
| dc.subject.swd | Laufzeitsystem | ger |
| dc.type.version | publishedVersion | |
| dcterms.source.identifier | eissn:2661-8907 | |
| dcterms.source.issue | Issue 4 | |
| dcterms.source.journal | SN Computer Science | eng |
| dcterms.source.volume | Volume 5 | |
| kup.iskup | false | |
| dcterms.source.articlenumber | Article: 349 |
Files in this item
This item appears in the following Collection(s)
-
Artikel [1109]
Except where otherwise noted, this item's license is described as Namensnennung 4.0 International