File(s) under permanent embargo
Workflow scheduling on distributed systems
conference contribution
posted on 2015-01-01, 00:00 authored by Maslina Abdul Aziz, Jemal AbawajyJemal Abawajy, R Islam, T Herawan,Growing evidence shows that in obtaining high performance, a well-managed time-constrained workflow scheduling is needed. Efficient workflow scheduling is critical for achieving high performance especially in heterogeneous computing system. However, it is a great challenge to improve performance and to optimize several objectives simultaneously. We propose a workflow scheduling algorithm that minimizes the makespan of the workflow application modeled by a Directed Acyclic Graph (DAG). The new proposed scheduling algorithm is named Multi Dependency Joint (MDJ) Algorithm. The performance of MDJ is compared with existing algorithms such as, Highest Level First with Estimated Time (HLFET), Modified Critical Path (MCP) and Earliest Time First (ETF). As a result, the experiments show that our proposed MDJ algorithm outperforms HLEFT, MCP, and EFT with a 7% lower overall completion time.
History
Event
IEEE Conference on Industrial Electronics and Applications (10th : 2015 : Auckland, New Zealand)Pagination
683 - 689Publisher
IEEELocation
Auckland, New ZealandPlace of publication
Piscataway, N.J.Publisher DOI
Start date
2015-06-15End date
2015-06-17ISBN-13
9781479983896Language
engPublication classification
E Conference publication; E1 Full written paper - refereedCopyright notice
2015, IEEEExtent
ICIEA 2015: Proceedings of the 10th IEEE conference on Industrial Electronics and ApplicationsTitle of proceedings
ICIEA 2015: Proceedings of the 10th IEEE conference on Industrial Electronics and ApplicationsUsage metrics
Categories
No categories selectedLicence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC