Abstract
The model of moldable task (MT) was introduced some years ago and has been proven to be an efficient way for implementing parallel applications. It considers a target application at a larger level of granularity than in other models (typically corresponding to numerical routines) where the tasks can themselves be executed in parallel on any number of processors. Clusters of SMPs (symmetric Multi-Processors) are a cost effective alternative to parallel supercomputers. Such hierarchical clusters are parallel systems made from m identical SMPs composed each by k identical processors. These architectures are more and more popular, however designing efficient software that take full advantage of such systems remains difficult. This work describes approximation algorithms for scheduling a set of tree precedence constrained moldable tasks for the minimization of the parallel execution time, with a scheme which is first used for two multi-processors and several bi-processors and then extended to the general case of any number of multi-processors. The best known approximations of competitive ratios for trees in the homogeneous case is 2.62, and although the hierarchical problem is harder our results are close as we obtain a ratio of 3.41 for two multi-processors, 3.73 for several bi-processors and 5.61 for the general case of several SMPs with a large number of processors. To our knowledge, this is the first work on precedence constrained moldable tasks on hierarchical platforms.
Chapter PDF
References
Dutot, P.F., Trystram, D.: Scheduling on hierarchical clusters using malleable tasks. In: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, pp. 199–208. ACM Press, New York (2001)
Du, J., Leung, J.T.: Complexity of scheduling parallel tasks systems. SIAM Journal on Discrete Mathematics 2, 473–487 (1989)
Lepere, R., Trystram, D., Woeginger, G.: Approximation algorithms for scheduling malleable tasks under precedence constraints. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 146–157. Springer, Heidelberg (2001)
Zhang, H.: Approximation Algorithms for Min-Max Resource Sharing and Malleable Tasks Scheduling. PhD thesis, University of Kiel, Germany (2004)
Jansen, K., Zhang, H.: Scheduling malleable tasks with precedence constraints. In: 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), Las Vegas (2005)
Jansen, K., Zhang, H.: An approximation algorithm for scheduling malleable tasks under general precedence constraints (2005) (submitted)
Skutella, M.: Approximation algorithms for the discrete time-cost tradeoff problem. Mathematics of Operations Research 23, 909–929 (1998)
Dutot, P.F.: Hierarchical scheduling for moldable tasks – extended version. Technical report, Laboratory ID-IMAG (2005), http://www-id.imag.fr/~pfdutot/perso.html
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
Dutot, PF. (2005). Hierarchical Scheduling for Moldable Tasks. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_35
Download citation
DOI: https://doi.org/10.1007/11549468_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)