کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
433059 | 689225 | 2012 | 15 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Optimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks Optimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks](/preview/png/433059.png)
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 subproblem is studied through the lens of the approximation theory. An algorithm, called DASEDF, is proposed and, through simulations, it is shown to outperform the first-come, first-served scheme. Furthermore, it is observed that machine availability is the key to getting good stretch values. Then, the moldable task scheduling problem is considered, and, by leveraging the results from the sequential case, another algorithm, DBOS, is proposed to optimize the stretch while scheduling moldable tasks. This work is motivated by a task scheduling problem in the context of parallel short sequence mapping which has important applications in biology and genetics. The proposed DBOS algorithm is evaluated both on synthetic data sets that represent short sequence mapping requests and on data sets generated using log files of real production clusters. The results show that the DBOS algorithm significantly outperforms the two state-of-the-art task scheduling algorithms on stretch optimization.
► We address the scheduling problem of optimizing the stretch of online tasks on a cluster.
► For sequential tasks, we propose an algorithm, DASEDF, which is a 2-approximation.
► Theoretical results indicate that machine availability is the key to low stretch.
► For moldable tasks, we propose an algorithm called DBOS.
► DBOS is an order of magnitude better than two state-of-the-art schedulers.
Journal: Journal of Parallel and Distributed Computing - Volume 72, Issue 4, April 2012, Pages 489–503