Research Article Open Access

An Optimal Load Sharing Technique For Grid Computing

D. Ramesh1 and A. Krishnan2
  • 1 Department of CSE, Anna University of Technology, Tiruchirappalli, India
  • 2 K.S. Rangasamy College of Technology, Tiruchengode, India


Problem statement: Grid and Cloud Computing is the fast growing industry, in which the grid computing shares the resources in the organization in an effective manner. Resource sharing requires more optimized algorithmic structure, otherwise the waiting time and response time are increased and the resource utilization is reduced. Approach: In order to avoid such reduction in the performances of the grid system, an optimal resource sharing algorithm is required. The traditional Min-Min algorithm is a simple algorithm that produces a schedule that minimizes the makespan than the other traditional algorithms in the literature. But it fails to produce a load balanced schedule. In our earlier study, a Load Balanced Min-Min (LBMM) algorithm is proposed that reduces the makespan and increases the resource utilization. This is further improved through Ant Colony Optimization (ACO) based optimization methodology. Results: In recent days, ACO plays a vital role in the discrete optimization problems. The ACO solves many engineering problems and provides optimal result which includes Travelling Salesman Problem, Network Routing and Scheduling. Conclusion: This study proposes an ACO based resource sharing algorithm for effective utilization of grid computing.

American Journal of Applied Sciences
Volume 9 No. 7, 2012, 1101-1106


Submitted On: 12 February 2012 Published On: 29 May 2012

How to Cite: Ramesh, D. & Krishnan, A. (2012). An Optimal Load Sharing Technique For Grid Computing. American Journal of Applied Sciences, 9(7), 1101-1106.

  • 0 Citations



  • Grid computing
  • Ant Colony Optimization (ACO)
  • resource sharing
  • Load Balanced Min-Min (LBMM)
  • First Come First Serve (FCFS)
  • Ant Colony System (ACS)