Published Articles >> Table of Contents >> Abstract

2002 International Conference on Parallel Processing Workshops (ICPPW'02)   p. 499
A De-Centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments
Manish Arora, University of Texas at Arlington
Sajal K. Das, University of Texas at Arlington
Rupak Biswas, NASA Ames Research Center

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPPW.2002.1039771
Send link to a friend

Abstract
In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper, we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is de-centralized, scalable, and overlaps the node coordination time with that of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.
Back to Top Additional Information
Citation:  Manish Arora, Sajal K. Das, Rupak Biswas, "A De-Centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments," icppw, p. 499,  2002 International Conference on Parallel Processing Workshops (ICPPW'02),  2002