Issue No.08 - Aug. (2013 vol.24)
Chi-Yeh Chen , Dept. of Comput. Sci. & Inf. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan
Chih-Ping Chu , Dept. of Comput. Sci. & Inf. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.258
Scheduling malleable tasks under general precedence constraints involves finding a minimum makespan (maximum completion time) by a feasible allotment. Based on the monotonous penalty assumptions of Blayo et al. , this work defines two assumptions concerning malleable tasks: the processing time of a malleable task is nonincreasing in the number of processors, while the work of a malleable task is nondecreasing in the number of processors. Additionally, the work function is assumed herein to be convex in the processing time. The proposed algorithm reformulates the linear program of , and this algorithm and associated proofs are inspired by the ones of . This work describes a novel polynomial-time approximation algorithm that is capable of achieving an approximation ratio of 2+√2≈3.4142. This work further demonstrates that the proposed algorithm can yield an approximation ratio of 2.9549 when the processing time is strictly decreasing in the number of the processors allocated to the task. This finding represents an improvement upon the previous best approximation ratio of 100/63+100(√6469+137)/5481≈3.2920  achieved under the same assumptions.
Approximation algorithms, Program processors, Approximation methods, Scheduling, malleable tasks, Approximation algorithms, Program processors, Approximation methods, Schedules, Processor scheduling, Scheduling, Manganese, precedence constraints, Approximation algorithms, scheduling
Chi-Yeh Chen, Chih-Ping Chu, "A 3.42-Approximation Algorithm for Scheduling Malleable Tasks under Precedence Constraints", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 8, pp. 1479-1488, Aug. 2013, doi:10.1109/TPDS.2012.258