On the load distribution and performance of meta-computing systems

In this paper, we study a high-performance Heterogeneous Distributed System (HDS) that is employed as a computing platform or grid. Precisely, we study the problem of scheduling a large number of CPU-intensive tasks on such systems. In this study, the time spent by a task in the system is considered as the main issue that needs to be minimized. The proposed techniques of scheduling dynamic tasks consist of two heuristic algorithms; Recursive Neighbor Search (RNS) and Augmented Tabu-Search (ATS) algorithm. Our technique does not address directly the load-balancing problem since it is completely unrealistic in such large environments, but we will show that even a nonperfectly load-balanced system can behave reasonably well by taking into account the tasks' time demands. These algorithms are compared to a well known scheduling algorithm, in order to compare, evaluate, and clarify their performance.

[1]  Thomas Kunz,et al.  The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme , 1991, IEEE Trans. Software Eng..

[2]  Alok Shriram,et al.  A Scheduling Model for Grid Computing Systems , 2001, GRID.

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

[4]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

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

[6]  Domenico Ferrari,et al.  An Empirical Investigation of Load Indices for Load Balancing Applications , 1987, Performance.

[7]  Kerim Tumay,et al.  Simulation modeling methods , 2000 .

[8]  Phillip Krueger,et al.  The Diverse Objectives of Distributed Scheduling Policies , 1987, ICDCS.

[9]  P. Aravindan,et al.  A Tabu Search Algorithm for Job Shop Scheduling , 2000 .

[10]  M. N. Shanmukha Swamy,et al.  Graphs: Theory and Algorithms , 1992 .

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

[12]  Virginia Mary Lo,et al.  Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.

[13]  Jack J. Dongarra,et al.  Experiments with Scheduling Using Simulated Annealing in a Grid Environment , 2002, GRID.

[14]  C.-H. Cho,et al.  Load Balancing for Minimizing Execution Time of a Target Job on a Network of Heterogeneous Workstations , 2000, JSSPP.

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

[16]  Alberto Bertoni,et al.  Structural Complexity and Neural Networks , 2002, WIRN.

[17]  Thomas L. Casavant,et al.  A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems , 1988, IEEE Trans. Software Eng..

[18]  M. N. S. Swamy,et al.  Graphs: Theory and Algorithms: Thulasiraman/Graphs , 1992 .

[19]  I ScottKirkpatrick.  Optimization by Simulated Annealing: Quantitative Studies , 1984 .

[20]  Michael Sampels,et al.  Metaheuristics for Group Shop Scheduling , 2002, PPSN.

[21]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[22]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.