Use of Run Time Predictions for Automatic Co-Allocation of Multi-Cluster Resources for Iterative Parallel Applications

Metaschedulers co-allocate resources by requesting a fixed number of processors and usage time for each cluster. These static requests, defined by users, limit the initial scheduling and prevent rescheduling of applications to other resource sets. It is also difficult for users to estimate application execution times, especially on heterogeneous environments. To overcome these problems, metaschedulers can use performance predictions for automaticresource selection. This paper proposes a resourceco-allocation technique with rescheduling support based on performance predictions for multi-clusteriterativeparallelapplications. Iterativeapplications have been used to solve a variety of problems in science and engineering, including large-scale computations based on the asynchronous model more recently. We performed experiments using an iterativeparallelapplication, which consists of benchmark multiobjective problems, with both synchronous and asynchronous communication models on Grid'5000. The results show runtimepredictions with an average error of 7% and prevention of up to 35% and 57% of runtime overestimations to support rescheduling for synchronous and asynchronous models, respectively. The performance predictions require no application source code access. One of the main findings is that as the asynchronous model masks communication and computation, it requires no network information to predict execution times. By using our co-allocation technique, metaschedulers become responsible for runtimepredictions, process mapping, and application rescheduling; releasing the user from these burden tasks.