The Community for Technology Leaders
RSS Icon
Issue No.07 - July (2009 vol.20)
pp: 940-952
Pierre-François Dutot , Université Pierre Mendês-France, Grenoble
Tchimou N'Takpé , Nancy University / LORIA, Nancy
Frédéric Suter , Nancy University / LORIA, Nancy
Henri Casanova , University of Hawaii at Manoa, Honolulu
Applications structured as parallel task graphs exhibit both data and task parallelism and arise in many domains. Scheduling these applications efficiently on parallel platforms has been a long-standing challenge. In the case of a single homogeneous platform, such as a cluster, results have been obtained both in theory, i.e., guaranteed algorithms, and, in practice, i.e., pragmatic heuristics. Due to task parallelism, these applications are well suited for execution on distributed platforms that span multiple clusters possibly in multiple institutions. However, the only available results in this context are nonguaranteed heuristics. In this paper, we develop a scheduling algorithm, MCGAS, which is applicable to multicluster platforms that are almost homogeneous. Such platforms are often found as large subsets of multicluster platforms. Our novel contribution is that MCGAS computes task allocations so that a (tunable) performance guarantee is provided. Since a performance guarantee does not necessarily imply good average performance in practice, we also compare MCGAS with a recently proposed nonguaranteed algorithm. Using simulation over a wide range of experimental scenarios, we find that MCGAS leads to better average application makespans than its competitor.
Mixed parallelism, parallel task graph scheduling, performance guarantee, multicluster platform.
Pierre-François Dutot, Tchimou N'Takpé, Frédéric Suter, Henri Casanova, "Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 7, pp. 940-952, July 2009, doi:10.1109/TPDS.2009.11
[1] S. Chakrabarti, J. Demmel, and K. Yelick, “Modeling the Benefits of Mixed Data and Task Parallelism,” Proc. Symp. Parallel Algorithms and Architectures (SPAA '95), pp.74-83, 1995.
[2] J. Turek, J. Wolf, and P. Yu, “Approximate Algorithms for Scheduling Parallelizable Tasks,” Proc. Symp. Parallel Algorithms and Architectures (SPAA '92), pp.323-332, 1992.
[3] W. Ludwig and P. Tiwari, “Scheduling Malleable and Nonmalleable Tasks,” Proc. Symp. Discrete Algorithms, pp.167-176, 1994.
[4] R. Lepere, D. Trystram, and G. Woeginger, “Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints,” Proc. Ninth Ann. European Symp. Algorithms (ESA '01), pp.146-157, 2001.
[5] 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.
[6] S. Bansal, P. Kumar, and K. Singh, “An Improved Two-Step Algorithm for Task and Data Parallel Scheduling in Distributed Memory Machines,” Parallel Computing, vol. 32, no. 10, pp.759-774, 2006.
[7] V. Boudet, F. Desprez, and F. Suter, “One-Step Algorithm for Mixed Data and Task Parallel Scheduling without Data Replication,” Proc. 17th Int'l Parallel and Distributed Processing Symp., 2003.
[8] A. Radulescu and A. van Gemund, “A Low-Cost Approach Toward Mixed Task and Data Parallel Scheduling,” Proc. 15th Int'l Conf. Parallel Processing (ICPP '01), Sept. 2001.
[9] S. Ramaswany, “Simultaneous Exploitation of Task and Data Parallelism in Regular Scientific Applications,” PhD dissertation, Univ. of Illi nois, 1996.
[10] T. Rauber and G. Rünger, “Compiler Support for Task Scheduling in Hierarchical Execution Models,” J. Systems Architecture, vol. 45, pp.483-503, 1998.
[11] N. Vydyanathan, S. Krishnamoorthy, G. Sabin, U. Catalyurek, T. Kurc, P. Sadayappan, and J. Saltz, “An Integrated Approach for Processor Allocation and Scheduling of Mixed-Parallel Applications,” Proc. 35th Int'l Conf. Parallel Processing (ICPP), 2006.
[12] T. N'takpé, F. Suter, and H. Casanova, “A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms,” Proc. Sixth Int'l Symp. Parallel and Distributed Computing, July 2007.
[13] P.-F. Dutot, “Hierarchical Scheduling for Moldable Tasks,” Proc. 11th Int'l Euro-Par Conf., pp.302-311, 2005.
[14] R. Bolze, F. Cappello, E. Caron, M. Daydé, F. Desprez, E. Jeannot, Y. Jégou, S. Lanteri, J. Leduc, N. Melab, G. Mornet, R. Namyst, P. Primet, B. Quetier, O. Richard, E.-G. Talbi, and T. Irena, “Grid'5000: A Large Scale and Highly Reconfigurable Experimental Grid Testbed,” Int'l J. High Performance Computing Applications, vol. 20, no. 4, pp.481-494, Nov. 2006.
[15] Grid5000, http:/, 2009.
[16] G. Amdahl, “Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities,” Proc. Am. Federation of Information Processing Soc. (AFIPS) 1967 Spring Joint Computer Conf., vol. 30, pp.483-485, Apr. 1967.
[17] F. Suter, “DAG Generation Program,” suterdags.html, 2009.
[18] Y.-K. Kwok and I. Ahmad, “Benchmarking and Comparison of the Task Graph Scheduling Algorithms,” J. Parallel and Distributed Computing, vol. 59, no. 3, pp.381-422, 1999.
[19] G.N.S. Prasanna and B.R. Musicus, “The Optimal Control Approach to Generalized Multiprocessor Scheduling,” Algorithmica, vol. 15, no. 1, pp.17-49, 1996.
[20] G.N.S. Prasanna and B.R. Musicus, “Generalized Multiprocessor Scheduling and Applications to Matrix Computations,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 6, pp.650-664, June 1996.
[21] M. Skutella, “Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem,” Math. of Operations Research, vol. 23, no. 4, pp.909-929, 1998.
[22] P.-F. Dutot and D. Trystram, “Scheduling on Hierarchical Clusters Using Malleable Tasks,” Proc. Symp. Parallel Algorithms and Architectures (SPAA '01), pp.199-208, 2001.
[23] T. N'Takpé and F. Suter, “Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms,” Proc. 12th Int'l Conf. Parallel and Distributed Systems (ICPADS '06), pp.3-10, July 2006.
[24] H. Casanova, F. Desprez, and F. Suter, “From Heterogeneous Task Scheduling to Heterogeneous Mixed Parallel Scheduling,” Proc. 10th Int'l Euro-Par Conf., pp.230-237, Aug. 2004.
[25] H. Topcuoglu, S. Hariri, and M.-Y. Wu, “Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, pp.260-274, Mar. 2002.
[26] M. Vanhoucke and D. Debels, “The Discrete Time/Cost Trade off Problem: Extensions and Heuristic Procedures,” J. Scheduling, vol. 10, nos.4/5, 2007.
[27] L.R. Graham, “Bounds on Multiprocessing Timing Anomalies,” SIAM J. Applied Math., vol. 2, pp.416-429, 1969.
[28] H. Casanova, A. Legrand, and M. Quinson, “SimGrid: A Generic Framework for Large-Scale Distributed Experiments,” Proc. 10th Int'l Conf. Computer Modeling and Simulation, Mar. 2008.
[29] SimGrid, http:/, 2009.
[30] H. Zhao and R. Sakellariou, “Scheduling Multiple DAGs onto Heterogeneous Systems,” Proc. 15th Heterogeneous Computing Workshop (HCW '06), Apr. 2006.
[31] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press/McGraw-Hill, 1990.
[32] N. Karmarkar, “A New Polynomial Time Algorithm for Linear Programming,” Combinatorica, vol. 4, no. 4, pp.373-395, 1984.
[33] D.G. Luenberger and Y. Ye, Linear and Nonlinear Programming, third ed. Springer, 2008.
[34] CPLEX,, 2009.
29 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool