The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - Aug. (2013 vol.24)
pp: 1479-1488
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
ABSTRACT
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. [2], 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 [11], and this algorithm and associated proofs are inspired by the ones of [11]. 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 [12] achieved under the same assumptions.
INDEX TERMS
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
CITATION
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
REFERENCES
[1] J. Augustine, S. Banerjee, and S. Irani, "Strip Packing with Precedence Constraints and Strip Packing with Release Times," Theoretical Computer Science, vol. 410, nos. 38-40, pp. 3792-3803, 2009.
[2] E. Blayo, L. Debreu, G. Mounié, and D. Trystram, "Dynamic Load Balancing for Ocean Circulation Model with Adaptive Meshing," Proc. Fifth European Conf. Parallel Computing (Euro-Par '99) pp. 303-312, 1999.
[3] D.E. Culler, R.M. Karp, D. Patterson, A. Sahay, E.E. Santos, K.E. Schauser, R. Subramonian, and T. von Eicken, "LogP: A Practical Model of Parallel Computation," Proc. Comm. ACM, vol. 39, no. 11, pp. 78-85, 1996.
[4] J. Du and J.Y.-T. Leung, "Complexity of Scheduling Parallel Task Systems," SIAM J. Discrete Math., vol. 2, no. 4, pp. 473-487, 1989.
[5] M.R. Garey and R.L. Graham, "Bounds for Multiprocessor Scheduling with Resource Constraints," SIAM J. Computing, vol. 4, no. 2, pp. 187-200, 1975.
[6] R.L. Graham, "Bounds for Certain Multiprocessing Anomalies," Bell System Technical J., vol. 45, no. 9, pp. 1563-1581, 1966.
[7] E. Günther, F. König, and N. Megow, "Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width," Proc. Seventh In'l Conf. Approximation and Online Algorithms, pp. 170-181, 2010.
[8] J.-J. Hwang, Y.-C. Chow, F.D. Anger, and C.-Y. Lee, "Scheduling Precedence Graphs in Systems with Interprocessor Communication Times," SIAM J. Computing, vol. 18, no. 2, pp. 244-257, 1989.
[9] K. Jansen, "Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme," Algorithmica, vol. 39, no. 1, pp. 59-81, 2004.
[10] K. Jansen and L. Porkolab, "Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks," Algorithmica, vol. 32, no. 3, pp. 507-520, 2002.
[11] K. Jansen and H. Zhang, "An Approximation Algorithm for Scheduling Malleable Tasks under General Precedence Constraints," ACM Trans. Algorithms, vol. 2, no. 3, pp. 416-434, 2006.
[12] K. Jansen and H. Zhang, "Scheduling Malleable Tasks with Precedence Constraints," J. Computer and System Sciences, vol. 78, no. 1, pp. 245-259, 2012.
[13] J.K. Lenstra and A.H.G. Rinnooy Kan, "Complexity of Scheduling under Precedence Constraints," Operations Research, vol. 26, no. 1, pp. 22-35, 1978.
[14] R. Lepére, G. Mounié, and D. Trystram, "An Approximation Algorithm for Scheduling Trees of Malleable Tasks," European J. Operational Research, vol. 142, no. 2, pp. 242-249, 2002.
[15] R. Lepére, D. Trystram, and G.J. Woeginger, "Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints," Int'l J. Foundations of Computer Science, vol. 13, no. 4, pp. 613-627, 2002.
[16] W. Ludwig and P. Tiwari, "Scheduling Malleable and Nonmalleable Parallel Tasks," Proc. Fifth Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '94), pp. 167-176, 1994.
[17] G. Mounié, C. Rapine, and D. Trystram, "A ${3\over 2}$ -Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks," SIAM J. Computing, vol. 37, no. 2, pp. 401-412, 2007.
[18] G. Mounié, C. Rapine, and D. Trystram, "Efficient Approximation Algorithms for Scheduling Malleable Tasks," Proc. 11th Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '99), pp. 23-32, 1999.
[19] M. Skutella, "Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem," Math. Operations Research, vol. 23, no. 4, pp. 909-929, 1998..
[20] G.N. Srinivasa Prasanna and B.R. Musicus, "Generalised Multiprocessor Scheduling Using Optimal Control," Proc. Third Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '91), pp. 216-228, 1991.
[21] J. Turek, J.L. Wolf, and P.S. Yu, "Approximate Algorithms Scheduling Parallelizable Tasks," Proc. Fourth Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '92), pp. 323-332, 1992.
[22] H. Zhang, "Approximation Algorithms for Min-Max Resource Sharing and Malleable Tasks Scheduling," PhD dissertation Univ. of Kiel, 2004.
43 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool