CFP last date
20 December 2024
Reseach Article

Load Balancing using Selection Method in Grid Environment

Published on None 2011 by R.Bindhuja, G.Arul Dalton, Dr.T.Jebarajan
International Conference on Emerging Technology Trends
Foundation of Computer Science USA
ICETT2011 - Number 2
None 2011
Authors: R.Bindhuja, G.Arul Dalton, Dr.T.Jebarajan
8a9103c2-3521-4031-9d57-47766491c3fc

R.Bindhuja, G.Arul Dalton, Dr.T.Jebarajan . Load Balancing using Selection Method in Grid Environment. International Conference on Emerging Technology Trends. ICETT2011, 2 (None 2011), 28-33.

@article{
author = { R.Bindhuja, G.Arul Dalton, Dr.T.Jebarajan },
title = { Load Balancing using Selection Method in Grid Environment },
journal = { International Conference on Emerging Technology Trends },
issue_date = { None 2011 },
volume = { ICETT2011 },
number = { 2 },
month = { None },
year = { 2011 },
issn = 0975-8887,
pages = { 28-33 },
numpages = 6,
url = { /proceedings/icett2011/number2/3503-icett013/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference on Emerging Technology Trends
%A R.Bindhuja
%A G.Arul Dalton
%A Dr.T.Jebarajan
%T Load Balancing using Selection Method in Grid Environment
%J International Conference on Emerging Technology Trends
%@ 0975-8887
%V ICETT2011
%N 2
%P 28-33
%D 2011
%I International Journal of Computer Applications
Abstract

Load balancing involves assigning to each processor, work proportional to its performance, minimizing the execution time of the program. The proposed methodology is designed for task graphs that are dynamic in nature due to the presence of conditional tasks and tasks whose execution times are unpredictable but bounded. Three-phase strategy as Equal Load Balancing, Dynamic Load Balancing and Selection Method. In first phase, task nodes are mapped to the processors. In second phase, Dynamic Load Balancing is a runtime scheduling algorithm that performs list scheduling based on the actual dynamics of the schedule up to the current time. In the third phase, selection method or DLB/JR method is performed that some critical nodes are identified and duplicated for possible rescheduling at runtime, depending on the code memory constraints of the processors. The third technique provides better schedule length compared to previous two techniques, which are predominantly static in nature, with low overhead and a complexity comparable with existing techniques.

References
  1. I. Ahmad and Y.-K. Kwok, 1994 A New Approach to Scheduling Parallel Programs Using Task Duplication.
  2. H. Attiya, 2004 Two Phase Algorithm for Load Balancing in Heterogeneous Distributed Systems.
  3. Banicescu I and V. Velusamy, 2002 Load Balancing Highly Irregular Computations with the Adaptive Factoring.
  4. S. Darbha and D.P. Agrawal, 1998 Optimal Scheduling Algorithm for Distributed Memory Machines.
  5. A.M. Dobber, G.M. Koole, and R.D. van der Mei, 2004 Dynamic Load Balancing for a Grid Application.
  6. A.M. Dobber, G.M. Koole, and R.D. van der Mei,2005 Dynamic Load Balancing Experiments in a Grid.
  7. A.M. Dobber, R.D. van der Mei, and G.M. Koole,2006 Effective Prediction of Job Processing Times in a Large Scale Grid Environment.
  8. A.M. Dobber, R.D. van der Mei, and G.M. Koole,2007 A Prediction Method for Job Running Times on Shared Processors.
  9. S. Darbha and D.P. Agrawal, 1998 Optimal Scheduling Algorithm for Distributed Memory Machines.
  10. A.M. Dobber, R.D. van der Mei, and G.M. Koole, 2006 Statistical Properties of Task Running Times in a Global Scale Grid Environment.
  11. G.-L. Park, B. Shirazi, and J. Marquis, 1998 Mapping of Parallel Tasks to Multiprocessors with Duplication.
Index Terms

Computer Science
Information Sciences

Keywords

Grid Computing Dynamic task scheduling Dynamic Load Balancing Job replication