Earticle

초록

영어

Grid computing allows, controlled and coordinated resource sharing and problem solving in dynamic, multi- institutional virtual organizations. Grids are categorized in to two, as Computational grid and Data grid. In computing grid, allocating resources to the tasks based on its requirements and task scheduling is an important issue. Generally, the task scheduler assigns tasks to a suitable resource. The nodes with better performance would be assigned first for execution. When the load on a grid was high, and all resource with a better performance is assigned, other tasks have to be assigned to the resource with unsuitable performance. To improve the performance and throughput of the system, it is required to assign the tasks to a suitable and lower fault rate processor. Therefore, if a task is allocated to a resource without considering the performance factor, resource fault rate, the overall execution time will increases and throughput will decreases obviously. To solve this problem, a task scheduling algorithm that finds suitable and low fault rate resource for task execution is introduced in this paper. Experiments made on GridSim, shows that the proposed algorithm works well in dynamic environments.

목차

Abstract
 1. Introduction
 2. Related Work
  2.1. Static Scheduling Algorithm
  2.2. Dynamic Scheduling Algorithm
 3. Selecting the Most suitable Resource for a Task
 4. Experimental Results
 5. Conclusion
 References

키워드

저자

• Jairam Naik K [ Research Scholar, Faculty of Computer Science & Engineering, JNT University, Hyderabad, India ]
• K. Vijaya Kumar [ Professor, BMS College of Engineering, Bangalore, India ]
• N. Satyanarayana [ Professor, Nagole institute of Technology & Science, Hyderabad, India ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605