文章基本信息

标题：A Scheduling Approach with Processor and Network Heterogeneity for Grid Environment
本地全文：下载
作者：Dr. Vinay Kumar ; Prof. C. P. Katti
期刊名称：International Journal on Computer Science and Engineering
印刷版ISSN：2229-5631
电子版ISSN：0975-3397
出版年度：2014
卷号：6
期号：01
页码：42-48
出版社：Engg Journals Publications
摘要：Processor heterogeneity is an important issue in grid environment. In this paper, a list based task scheduling algorithm, called �critical path scheduling with t-level� (CPST) for grid computing system is proposed. There are no. of scheduling algorithms such as HEFT [1] use mean execution time based b-level for task priority and SHCP [2] use task priority based on simple critical path. In CPST, a critical path based task sequence is generated with t-level value of tasks, where variance based computation and communication cost is used. The experimental results show that CPST algorithm performs better than HEFT, SHCP and HHS algorithm in grid environment for task graphs.
关键词：Grid Scheduling; Directed Acyclic Graph; Critical Path; Heterogeneity.