Efficient Scalable Computing through Flexible Applications and Adaptive Workloads
Document typeConference lecture
Rights accessOpen Access
In this paper we introduce a methodology for dynamic job reconfiguration driven by the programming model runtime in collaboration with the global resource manager. We improve the system throughput by exploiting malleability techniques (in terms of number of MPI ranks) through the reallocation of resources assigned to a job during its execution. In our proposal, the OmpSs runtime reconfigures the number of MPI ranks during the execution of an application in cooperation with the Slurm workload manager. In addition, we take advantage of OmpSs offload semantics to allow application developers deal with data redistribution. By combining these elements a job is able to expand itself in order to exploit idle nodes or be shrunk if other queued jobs could be initiated. This novel approach adapts the system workload in order to increase the throughput as well as make a smarter use of the underlying resources. Our experiments demonstrate that this approach can reduce the total execution time of a practical workload by more than 40% while reducing the amount of resources by 30%.
CitationIserte, S. [et al.]. Efficient Scalable Computing through Flexible Applications and Adaptive Workloads. A: "2017 46th International Conference on Parallel Processing Workshops (ICPPW)". IEEE, 2017, p. 180-189.