TY  - JOUR
AU  - Ramesh, D. 
AU  - Krishnan, A. 
PY  - 2011
TI  - Hybrid Algorithm for Optimal Load Sharing in Grid Computing
JF  - Journal of Computer Science
VL  - 8
IS  - 1
DO  - 10.3844/jcssp.2012.175.180
UR  - https://thescipub.com/abstract/jcssp.2012.175.180
AB  - 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.