Earticle

초록

영어

Grid Computing provides seamless and scalable access to wide-area distributed resources. Since, computational grid shares, selects and aggregates wide variety of geographically distributed computing resources and presents them as a single resource for solving large scale computing applications, there is a need for a scheduling algorithm which takes into account the various requirements of grid environment. Hence, this research proposes a new scheduling algorithm for computational grids that considers load balancing, fault tolerance and user satisfaction based on the grid architecture, resource heterogeneity, resource availability and job characteristics such as user deadline. This algorithm reduces the makespan of the schedule along with user satisfaction and balanced load. A simulation is conducted using Grid Simulator Toolkit (GridSim). The simulation results shows that the proposed algorithm has better makespan, hit rate and resource utilization.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Materials and Methods
  3.1. Problem Formulation
  3.2. Proposed MCSA Algorithm
  3.3. Simulation Setup
 4. Results and Discussion
 5. Conclusion and Future Work
 References

키워드

저자

• P. Keerthika [ Research Scholar and Assistant Professor (Senior Grade), Department of CSE, Kongu Engineering College ]
• N. Kasthuri [ Professor, Department of ECE, Kongu Engineering College ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Advanced Science and Technology

• 간기

  월간

• pISSN

  2005-4238

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605