Research Article Open Access

Hybrid Algorithm for Optimal Load Sharing in Grid Computing

D. Ramesh and A. Krishnan

Abstract

Problem statement: Grid Computing is the fast growing industry, which 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. In recent days, many load sharing technique are proposed, which provides feasibility but there are many critical issues are still present in these algorithms. Results: In this study a hybrid algorithm for optimization of load sharing is proposed. The hybrid algorithm contains two components which are Hash Table (HT) and Distributed Hash Table (DHT). Conclusion: The results of the proposed study show that the hybrid algorithm will optimize the task than existing systems.

Journal of Computer Science
Volume 8 No. 1, 2012, 175-180

DOI: https://doi.org/10.3844/jcssp.2012.175.180

Submitted On: 13 October 2011 Published On: 5 November 2011

How to Cite: Ramesh, D. & Krishnan, A. (2012). Hybrid Algorithm for Optimal Load Sharing in Grid Computing. Journal of Computer Science, 8(1), 175-180. https://doi.org/10.3844/jcssp.2012.175.180

  • 3,034 Views
  • 2,781 Downloads
  • 3 Citations

Download

Keywords

  • Hash Table (HT)
  • Distributed Hash Table (DHT)
  • High Performance Computing (HPC)
  • distributed computing
  • information virtualization
  • double hashing reduces
  • grid environment
  • heterogeneous network
  • computing components