Earticle

초록

영어

Task scheduling under a grid environment is an important research area, on which much
attention has been paid. However, either in the meta-task scheduling problems or DAG
(Direct Acyclic Graph) scheduling problems, it is usually assumed that tasks are submitted to
dedicated hosts and that these tasks are processed in FIFO (First In First Out) order. This is
not practical in a grid, in which a host may be shared between grid users and its owner and
local tasks, which belong to resource owners, may compete with grid tasks for the hosts.
EBGSA (Estimation Based Grid Scheduling Approach) is proposed, which allows for the
simultaneous processing of grid tasks and local tasks. In EBGSA we use history information
about the execution of tasks to estimate the performance of non-dedicated hosts. Two
heuristic scheduling algorithms, MCT (Minimum Completion Time) and Min-min, are
selected to perform the simulation experiment. Both experiments obtain a smaller makespan,
proving EBGSA feasible for grid task scheduling.

목차

Abstract
 1. Introduction
 2. Problem Definition
  2.1. Performance Metrics
  2.2. Problems with Existing Algorithms
 3. EBGSA
  3.1. Applying EBGSA to MCT and Min-min
  3.2. Estimating the Time Variable
 4. Simulation
  4.1. Simulation Environment
  4.2. Simulation Procedures
  4.3. The Result and Discussion
 5. Conclusion
 References

저자

• Zhan Gao [ School of Computer and Information Technology Beijing Jiaotong University ]
• Siwei Luo [ School of Computer and Information Technology Beijing Jiaotong University ]
• Ding Ding [ School of Computer and Information Technology Beijing Jiaotong University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605