A Synthesized Heuristic Task Scheduling Algorithm

Aiming at the static task scheduling problems in heterogeneous environment, a heuristic task scheduling algorithm named HCPPEFT is proposed. In task prioritizing phase, there are three levels of priority in the algorithm to choose task. First, the critical tasks have the highest priority, secondly t...

Full description

Saved in:
Bibliographic Details
Main Authors: Yanyan Dai, Xiangli Zhang
Format: Article
Language:English
Published: Wiley 2014-01-01
Series:The Scientific World Journal
Online Access:http://dx.doi.org/10.1155/2014/465702
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850172442263158784
author Yanyan Dai
Xiangli Zhang
author_facet Yanyan Dai
Xiangli Zhang
author_sort Yanyan Dai
collection DOAJ
description Aiming at the static task scheduling problems in heterogeneous environment, a heuristic task scheduling algorithm named HCPPEFT is proposed. In task prioritizing phase, there are three levels of priority in the algorithm to choose task. First, the critical tasks have the highest priority, secondly the tasks with longer path to exit task will be selected, and then algorithm will choose tasks with less predecessors to schedule. In resource selection phase, the algorithm is selected task duplication to reduce the interresource communication cost, besides forecasting the impact of an assignment for all children of the current task permits better decisions to be made in selecting resources. The algorithm proposed is compared with STDH, PEFT, and HEFT algorithms through randomly generated graphs and sets of task graphs. The experimental results show that the new algorithm can achieve better scheduling performance.
format Article
id doaj-art-c804c678209e4f0f90dfc08ccc110a4d
institution OA Journals
issn 2356-6140
1537-744X
language English
publishDate 2014-01-01
publisher Wiley
record_format Article
series The Scientific World Journal
spelling doaj-art-c804c678209e4f0f90dfc08ccc110a4d2025-08-20T02:20:06ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/465702465702A Synthesized Heuristic Task Scheduling AlgorithmYanyan Dai0Xiangli Zhang1Institute of Information and Communication, Guilin University of Electronic Technology, Guilin 541004, ChinaInstitute of Information and Communication, Guilin University of Electronic Technology, Guilin 541004, ChinaAiming at the static task scheduling problems in heterogeneous environment, a heuristic task scheduling algorithm named HCPPEFT is proposed. In task prioritizing phase, there are three levels of priority in the algorithm to choose task. First, the critical tasks have the highest priority, secondly the tasks with longer path to exit task will be selected, and then algorithm will choose tasks with less predecessors to schedule. In resource selection phase, the algorithm is selected task duplication to reduce the interresource communication cost, besides forecasting the impact of an assignment for all children of the current task permits better decisions to be made in selecting resources. The algorithm proposed is compared with STDH, PEFT, and HEFT algorithms through randomly generated graphs and sets of task graphs. The experimental results show that the new algorithm can achieve better scheduling performance.http://dx.doi.org/10.1155/2014/465702
spellingShingle Yanyan Dai
Xiangli Zhang
A Synthesized Heuristic Task Scheduling Algorithm
The Scientific World Journal
title A Synthesized Heuristic Task Scheduling Algorithm
title_full A Synthesized Heuristic Task Scheduling Algorithm
title_fullStr A Synthesized Heuristic Task Scheduling Algorithm
title_full_unstemmed A Synthesized Heuristic Task Scheduling Algorithm
title_short A Synthesized Heuristic Task Scheduling Algorithm
title_sort synthesized heuristic task scheduling algorithm
url http://dx.doi.org/10.1155/2014/465702
work_keys_str_mv AT yanyandai asynthesizedheuristictaskschedulingalgorithm
AT xianglizhang asynthesizedheuristictaskschedulingalgorithm
AT yanyandai synthesizedheuristictaskschedulingalgorithm
AT xianglizhang synthesizedheuristictaskschedulingalgorithm