Scheduling Moldable BSP Tasks
نویسندگان
چکیده
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use fewer processors than the original required, but with a particular cost model. We discuss the problem of scheduling a batch of BSP tasks on a fixed number of computers. The objective is to minimize the completion time of the last task (makespan). We show that the problem is difficult and present approximation algorithms and heuristics. We finish the paper presenting the results of extensive simulations under different workloads.
منابع مشابه
Scheduling Moldable Tasks for Dynamic SMP Clusters in SoC Technology
The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on the fly. The algorithm is based on the concept of moldable computational tasks. First, an initial program graph is decomposed into sub–graphs, which are then treated as moldable tasks. So identified moldable tasks are then sched...
متن کاملOptimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks
This paper addresses the problem of scheduling non-preemptive moldable tasks to minimize the stretch of the tasks in an online non-clairvoyant setting. To the best of the authors’ knowledge, this problem has never been studied before. To tackle this problem, first the sequential sub-problem is studied through the lens of the approximation theory. An algorithm, called DASEDF, is proposed and, th...
متن کاملA Robust Scheduling Strategy for Moldable Scheduling of Parallel Jobs
Moldable job scheduling has been proved to be effective compared to traditionaljob scheduling policies. It is based on the observation that most jobs submitted to a spaceshared parallel system can actually reduce their response times if they were allowed to take any number of processors in a user-specified range. Previous approaches to scheduling of moldable jobs focused on when and how to choo...
متن کاملHierarchical Scheduling for Moldable Tasks extended version
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application at a larger level of granularity than in other models (corresponding typically to numerical routines) where the tasks can themselves be executed in parallel on any number of processors. Clusters of SMP (symmetric Multi...
متن کاملA Best-compromise Bicriteria Scheduling Algorithm for Parallel Tasks
We consider in this paper the problem of scheduling a set of independent parallel tasks (jobs) with respect to two criteria, namely, the makespan (time of the last finishing job) and the minsum (average completion time). There exist several algorithms with a good performance guaranty for one of these criteria. We are interested here in studying the optimization of both criteria simultaneously. ...
متن کامل