Patrick Finnerty

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 easy-to-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 real-world 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 best-performing scheduling algorithm with 100% rigid jobs.

Global load balancer libraries should be easy to use and allow users to easily obtain good performance for their applications on a variety of distributed systems. In this article, we introduce a new tuning mechanism to our Java implementation of the lifeline-based global load balancer which automatically adjusts the task granularity to reach good performance based on some selected runtime metrics. We evaluate our system against four backtrack-search problems on both a many-core supercomputer environment and on a beowulf server, achieving ideal performance with our tuning mechanism on the supercomputer. We also identify the limits of our mechanism in handling situations with reduced imbalance.

To support the rapid proliferation of IoT devices, non-uniform multiple access (NOMA) admission control appears as a promising technology. Indeed, through spectrum reuse, it allows more devices to communicate than the traditional orthogonal frequency-division multiple access scheme of 4G. Previous research has shown that the NOMA allocation problem can be formulated into a maximum independent set problem, which is NP-hard. Recent advances in quadratic unconstrained binary optimization (QUBO) solvers show promise in their capability to solve this kind of allocation problems efficiently. We explore various QUBO formulations to determine which is best-suited for the high-frequency requirements of the NOMA allocation problem.