A stochastic scheduling algorithm for precedence constrained tasks on Grid

This paper addresses the problems in scheduling a precedence constrained tasks of parallel application with random tasks processing time and edges communication time on Grid computing systems so as to minimize the makespan in stochastic environment. This is a difficult problem and few efforts have been reported on its solution in the literature. The problem is first formulated in a form of stochastic scheduling model on Grid systems. Then, a stochastic heterogeneous earliest finish time (SHEFT) scheduling algorithm is developed that incorporates the expected value and variance of stochastic processing time into scheduling. Our rigorous performance evaluation study, based on randomly generated stochastic parallel application DAG graphs, shows that our proposed SHEFT scheduling algorithm performs much better than the existing scheduling algorithms in terms of makespan, speedup, and makespan standard deviation.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  K. Mani Chandy,et al.  Scheduling partially ordered tasks with probabilistic execution times , 1975, SOSP.

[3]  Christian Haubelt,et al.  SystemCoDesigner—an automatic ESL synthesis approach by design space exploration and behavioral synthesis for streaming applications , 2009, TODE.

[4]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[5]  John N. Tsitsiklis,et al.  On Stochastic Scheduling with In-Tree Precedence Constraints , 1987, SIAM J. Comput..

[6]  Kenli Li,et al.  Reliability-aware scheduling strategy for heterogeneous distributed computing systems , 2010, J. Parallel Distributed Comput..

[7]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[8]  Zhen Liu,et al.  On the Optimal Stochastic Scheduling of Out-Forests , 1992, Oper. Res..

[9]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[10]  David A. Padua,et al.  Communication contention in APN list scheduling algorithm , 2009, Science in China Series F: Information Sciences.

[11]  Edwin Hsing-Mean Sha,et al.  Probabilistic Loop Scheduling for Applications with Uncertain Execution Time , 2000, IEEE Trans. Computers.

[12]  Edward A. Lee,et al.  A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures , 1993, IEEE Trans. Parallel Distributed Syst..

[13]  Ishfaq Ahmad,et al.  Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors , 1996, IEEE Trans. Parallel Distributed Syst..

[14]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[15]  G. Weiss,et al.  Approximation results in parallel machnies stochastic scheduling , 1991 .

[16]  Hesham El-Rewini,et al.  Scheduling Parallel Program Tasks onto Arbitrary Target Machines , 1990, J. Parallel Distributed Comput..

[17]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[18]  Nicole Megow,et al.  Models and Algorithms for Stochastic Online Scheduling , 2006, Math. Oper. Res..

[19]  Radu Prodan,et al.  Towards a general model of the multi-criteria workflow scheduling on the grid , 2009, Future Gener. Comput. Syst..

[20]  Michael H. Rothkopf.  Scheduling with Random Service Times , 1966 .

[21]  Gideon Weiss,et al.  Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling , 1992, Math. Oper. Res..

[22]  Emmanouel A. Varvarigos,et al.  A comparison of centralized and distributed meta-scheduling architectures for computation and communication tasks in Grid networks , 2009, Comput. Commun..

[23]  Michael Pinedo,et al.  Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines , 1985, Oper. Res..

[24]  John L. Bruno.  On scheduling tasks with exponential service times and in-tree precedence constraints , 2004, Acta Informatica.

[25]  Rolf H. Möhring,et al.  Approximation in stochastic scheduling: the power of LP-based priority policies , 1999, JACM.

[26]  Martin Skutella,et al.  Stochastic Machine Scheduling with Precedence Constraints , 2005, SIAM J. Comput..

[27]  Mohammad Kazem Akbari,et al.  A parallel solution for scheduling of real time applications on grid environments , 2009, Future Gener. Comput. Syst..

[28]  Selim G. Akl,et al.  Scheduling Algorithms for Grid Computing: State of the Art and Open Problems , 2006 .

[29]  Füsun Özgüner,et al.  Parallelizing Existing Applications in a Distributed Heterogeneous Environment , 1995 .

[30]  Kenli Li,et al.  List scheduling with duplication for heterogeneous computing systems , 2010, J. Parallel Distributed Comput..

[31]  Meikang Qiu,et al.  Cost minimization while satisfying hard/soft timing constraints for heterogeneous embedded systems , 2009, TODE.