An approximation algorithm for scheduling malleable tasks under general precedence constraints
An approximation algorithm for scheduling malleable tasks under general precedence constraints
复制标题
一种在一般优先级约束下调度可延展任务的近似算法
DOI：
10.1145/1159892.1159899
复制
发表时间：
2005
影响因子：
5.3
通讯作者：
Hu Zhang
中科院分区：
文献类型：
--
作者：
K. Jansen;Hu Zhang
在本文中，我们研究了具有优先限制的可锻造任务的问题。根据优先级的限制是最大程度地减少最佳的先前近似算法（在两个阶段起作用）的MakePAN（最大完成时间）。 ＆SQRT;5≈5≈236。
In this article, we study the problem of scheduling malleable tasks with precedence constraints. We are given m identical processors and n tasks. For each task the processing time is a function of the number of processors allotted to it. In addition, the tasks must be processed according to the precedence constraints. The goal is to minimize the makespan (maximum completion time) of the resulting schedule. The best previous approximation algorithm (that works in two phases) in Lepère et al. [2002b] has a ratio 3 + &sqrt;5≈ 5.236. We develop an improved approximation algorithm with a ratio at most 100/43 + 100(&sqrt;4349 − 7)/2451 ≈ 4.730598. We also show that our resulting ratio is asymptotically tight.