Earticle

초록

영어

High throughput computing (HTC) is of great importance in grid computing environments. HTC is aimed at minimizing the total makespan of all of the tasks submitted to the grid environment in long execution of the system. To achieve HTC in grids, suitable task scheduling algorithms should be applied to dispatch the submitted tasks to the computational resources appropriately. In this paper, a new task scheduling algorithm is proposed to assign the tasks to the grid resources with goal of minimizing the total makespan of the environment. The proposed algorithm uses genetic approach to find the most suitable match between the tasks and grid resources. The simulation results obtained from applying the proposed algorithm to schedule independent and sequential tasks to the grid resources demonstrate the applicability of the algorithm in grid environments.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Background Information
  3.1. Grid Computing Environments
  3.2. Task Scheduling Algorithms
  3.3. Genetic Optimization Approach
 4. The Proposed Algorithm
 5. Simulation Results
 References

키워드

저자

• Reza Entezari - Maleki [ Department of Computer Engineering, Sharif University of Technology, Tehran, Iran ]
• Ali Movaghar [ Department of Computer Engineering, Sharif University of Technology, Tehran, Iran ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605