Scheduling with uncertainties on new computing platforms

New distributed computing platforms (grids) are based on interconnections of a large number of processing elements. A most important issue for their effective utilization is the optimal use of resources through proper task scheduling. It consists of allocating the tasks of a parallel program to processors on the platform and to determine at what time the tasks will start their execution. As data may be subject to uncertainties or disturbances, it is practically impossible to precisely predict the input parameters of the task scheduling problem.We briefly survey existing approaches for dealing with data uncertainties and discuss their relevance in the context of grid computing. We describe the stabilization process and analyze a scheduling algorithm that is intrinsically stable (i.e., it mitigates the effects of disturbances in input data at runtime). This algorithm is based on a decomposition of the application graph into convex sets of vertices. Finally, it is compared experimentally to pure on-line and well-known off-line algorithms.

[1]  Carolyn McCreary,et al.  Automatic determination of grain size for efficient parallel processing , 1989 .

[2]  Victor J. Rayward-Smith,et al.  UET scheduling with unit interprocessor communication delays , 1987, Discret. Appl. Math..

[3]  Denis Trystram,et al.  A new clustering algorithm for large communication delays , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[4]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[5]  Denis Trystram,et al.  Convex Scheduling for Grid Computing , 2004 .

[6]  Gilles Fedak,et al.  Global Computing Systems , 2001, LSSC.

[7]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[8]  Adam Kasperski.  Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion , 2005, Oper. Res. Lett..

[9]  Hugh Garraway.  Parallel Computer Architecture: A Hardware/Software Approach , 1999, IEEE Concurrency.

[10]  Eric Sanlaville,et al.  Sensitivity analysis of tree scheduling on two machines with communication delays , 2004, Parallel Comput..

[11]  Jan Van Damme,et al.  Project scheduling under uncertainty survey and research potentials , 2002 .

[12]  Panagiotis Kouvelis,et al.  Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .

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

[14]  Igor Averbakh,et al.  On the complexity of a class of combinatorial optimization problems with uncertainty , 2001, Math. Program..

[15]  Yang Jian,et al.  On the robust shortest path problem , 1998, Comput. Oper. Res..

[16]  Roberto Montemanni,et al.  A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval Data , 2007, J. Math. Model. Algorithms.

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

[18]  Rajkumar Buyya,et al.  High Performance Cluster Computing: Architectures and Systems , 1999 .

[19]  Igor Averbakh,et al.  Complexity of minimizing the total flow time with interval data and minmax regret criterion , 2006, Discret. Appl. Math..

[20]  B. Korte,et al.  Mathematical Programming the State of the Art: Bonn 1982 , 1983 .

[21]  Mohamed Ali Aloulou,et al.  Incorporating flexibility in job sequencing for the single machine total weighted tardiness problem with release dates , 2001 .

[22]  Patrick Jaillet,et al.  A Priori Optimization , 1990, Oper. Res..

[23]  P. Winkler.  Random orders , 1985 .

[24]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[25]  Carolyn McCreary,et al.  Automatic determination of grain size for efficient parallel processing , 1989, CSC '89.

[26]  Jiri Sgall.  On-Line Scheduling on Parallel Machines , 1994 .

[27]  Frank D. Anger,et al.  Scheduling Precedence Graphs in Systems with Interprocessor Communication Times , 1989, SIAM J. Comput..

[28]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[29]  E. L. Lawler,et al.  Recent Results in the Theory of Machine Scheduling , 1982, ISMP.

[30]  Vivek Sarkar,et al.  Partitioning and scheduling parallel programs for execution on multiprocessors , 1987 .

[31]  Pascal Bouvry,et al.  ANDES: Evaluating mapping strategies with synthetic programs , 1996, J. Syst. Archit..

[32]  Denis Trystram,et al.  Sensitivity analysis of scheduling algorithms , 2001, Eur. J. Oper. Res..

[33]  Tao Yang,et al.  DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors , 1994, IEEE Trans. Parallel Distributed Syst..

[34]  Mihalis Yannakakis,et al.  Towards an Architecture-Independent Analysis of Parallel Algorithms , 1990, SIAM J. Comput..

[35]  Marc E. Posner,et al.  Sensitivity Analysis for Scheduling Problems , 2004, J. Sched..

[36]  Denis Trystram,et al.  Scheduling Precedence Task Graphs with Disturbances , 2003, RAIRO Oper. Res..