A routing load balancing policy for grid computing environments

The evolution of computers and networks has motivated the development of high performance systems using the distributed system concepts. Such evolution has motivated the study of load balancing techniques, low latency protocols, operating systems and middlewares. Furthermore, the evolution from distributed systems based on clusters to grid environments has motivated new researches to define load balancing algorithms to support scalable and heterogeneous computing capacity environments. In this paper, the route load balancing algorithm is proposed, presented and evaluated. This algorithm is designed to equally distribute the workload of tasks of parallel applications over grid computing environments. Experiments compare the performance of the proposed algorithm to others from literature. The obtained results allow concluding that the route algorithm is indicated for environments where there are several heterogeneous computers and parallel applications are composed of multiple tasks.

[1]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

[2]  Mukesh Singhal,et al.  Load distributing for locally distributed systems , 1992, Computer.

[3]  Jeffrey S. Vetter,et al.  Communication characteristics of large-scale scientific applications for contemporary cluster architectures , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[4]  Laurence T. Yang,et al.  Comparative study of the server-initiated lowest algorithm using a load balancing index based on the process behavior for heterogeneous environment , 2006, Cluster Computing.

[5]  Francine Berman,et al.  Overview of the Book: Grid Computing – Making the Global Infrastructure a Reality , 2003 .

[6]  Rodrigo Fernandes de Mello,et al.  A new migration model based on the evaluation of processes load and lifetime on heterogeneous computing environments , 2004, 16th Symposium on Computer Architecture and High Performance Computing.

[7]  Anand Sivasubramaniam,et al.  An approach to scalability study of shared memory parallel systems , 1994, SIGMETRICS.

[8]  Arjan J. C. van Gemund,et al.  LLB: A fast and effective scheduling algorithm for distributed-memory systems , 1999, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999.

[9]  Baruch Awerbuch,et al.  An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster , 2000, IEEE Trans. Parallel Distributed Syst..

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

[11]  Rodrigo Fernandes de Mello,et al.  Analysis on the significant information to update the tables on occupation of resources by using a peer-to-peer protocol , 2002, Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications.

[12]  Tae-Young Choe,et al.  A task duplication based scheduling algorithm with optimality condition in heterogeneous systems , 2002, Proceedings. International Conference on Parallel Processing Workshop.

[13]  Rajkumar Buyya,et al.  High Performance Cluster Computing , 1999 .

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

[15]  Dror G. Feitelson,et al.  Improved Utilization and Responsiveness with Gang Scheduling , 1997, JSSPP.

[16]  Laurence T. Yang,et al.  Improving Scheduling Decisions by Using Knowledge About Parallel Applications Resource Usage , 2005, HPCC.

[17]  Marcos José Santana,et al.  Scheduling based on the impact over process communication of parallel applications , 2005, 19th International Symposium on High Performance Computing Systems and Applications (HPCS'05).

[18]  Roger W. Hockney.  The science of computer benchmarking , 1995, Software, environments, tools.

[19]  Domenico Ferrari,et al.  An Experimental Study of Load Balancing Performance , 1987 .

[20]  Marcos José Santana,et al.  A New Dynamical Scheduling Algorithm , 1999, PDPTA.

[21]  Rajkumar Buyya,et al.  GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing , 2002, Concurr. Comput. Pract. Exp..

[22]  Dharma P. Agrawal,et al.  A task duplication based scheduling algorithm for heterogeneous systems , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[23]  Chita R. Das,et al.  Towards a communication characterization methodology for parallel applications , 1997, Proceedings Third International Symposium on High-Performance Computer Architecture.