Abstract
In this paper 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) by Lepére et al. [18] has a ratio \(3 + \sqrt{5} \approx 5.236\). We develop an improved approximation algorithm with a ratio at most \(100/43 + 100(\sqrt{4349} - 7)/2451 \approx 4.730598\). We also show that our resulting ratio is asymptotically tight.
Chapter PDF
References
Blayo, E., Debrue, L., Mounié, G., Trystram, D.: Dynamic load balancing for ocean circulation with adaptive meshing. In: Amestoy, P.R., Berger, P., Daydé, M., Duff, I.S., Frayssé, V., Giraud, L., Ruiz, D. (eds.) Euro-Par 1999. LNCS, vol. 1685, pp. 303–312. Springer, Heidelberg (1999)
Culler, D.E., Karp, R., Patterson, D., Sahay, A., Santos, E., Schauser, K., Subramonian, R., von Eicken, T.: LogP: A practical model of parallel computation. Communications of the ACM 39(11), 78–85 (1996)
Culler, D.E., Singh, J.P., Gupta, A.: Parallel computer architecture: A hardware/software approach. Morgan Kaufmann Publishers, San Francisco (1999)
Du, J., Leung, J.: Complexity of scheduling parallel task systems. SIAM Journal on Discrete Mathematics 2, 473–487 (1989)
Dutot, P.-F., Mounié, G., Trystram, D.: Scheduling parallel tasks – approximation algorithms. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004)
Fulkerson, D.R.: A network flow computation for project cost curves. Management Science 7, 167–178 (1961)
Garey, M., Graham, R.: Bounds for multiprocessor scheduling with resource constraints. SIAM Journal on Computing 4, 187–200 (1975)
Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)
Hwang, J.J., Chow, Y.C., Anger, F.D., Lee, C.Y.: Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing 18(2), 244–257 (1989)
Jansen, K.: Scheduling malleable parallel tasks: an asymptotic fully polynomial-time approximation scheme. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 562–573. Springer, Heidelberg (2002)
Jansen, K., Porkolab, L.: Linear-time approximation schemes for scheduling malleable parallel tasks. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, pp. 490–498 (1999)
Jansen, K., Zhang, H.: Improved approximation algorithms for scheduling malleable tasks with precedence constraints. Technical Report, http://www.informatik.uni-kiel.de/~hzh/malle.ps
Jansen, K., Zhang, H.: Scheduling malleable tasks with precedence constraints. In: Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2005, pp. 86–95 (2005)
Kalinowski, T., Kort, I., Trystram, D.: List scheduling of general task graphs under LogP. Parallel Computing 26(9), 1109–1128 (2000)
Kelley, J.E.: Critical path planning and scheduling: mathematical bases. Operations Research 9, 296–320 (1961)
Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Operations Research 26, 22–35 (1978)
Lepère, R., Mounié, G., Trystram, D.: An approximation algorithm for scheduling trees of malleable tasks. European Journal of Operational Research 142(2), 242–249 (2002)
Lepère, R., Trystram, D., Woeginger, G.J.: Approximation algorithms for scheduling malleable tasks under precedence constraints. International Journal of Foundations of Computer Science 13(4), 613–627 (2002)
Ludwig, W., Tiwari, P.: Scheduling malleable and nonmalleable parallel tasks. In: Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, SODA 1994, pp. 167–176 (1994)
Mounié, G., Rapine, C., Trystram, D.: Efficient approximation algorithms for scheduling malleable tasks. In: Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1999, pp. 23–32 (1999)
Mounié, G., Rapine, C., Trystram, D.: A 3/2-dual approximation algorithm for scheduling independent monotonic malleable tasks (manuscript)
Prasanna, G.N.S., Musicus, B.R.: Generalised multiprocessor scheduling using optimal control. In: Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1991, pp. 216–228 (1991)
Skutella, M.: Approximation algorithms for the discrete time-cost tradeoff problem. Mathematics of Operations Research 23, 909–929 (1998)
Turel, J., Wolf, J., Yu, P.: Approximate algorithms for scheduling parallelizable tasks. In: Proceedings of the 4th Annual Symposium on Parallel Algorithms and Architectures, SPAA 1992, pp. 323–332 (1992)
Zhang, H.: Approximation Algorithms for Min-Max Resource Sharing and Malleable Tasks Scheduling. Ph.D. Thesis, University of Kiel, Germany (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jansen, K., Zhang, H. (2005). An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_25
Download citation
DOI: https://doi.org/10.1007/11602613_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)