Workflow scheduling on distributed systems

Maslina Abdul Aziz, Jemal Abawajy, MD Rafiqul Islam, Tutut Herawan

Research output: Book chapter/Published conference paperConference paperpeer-review

1 Citation (Scopus)
6 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationProceedings of the 2015 IEEE 10th Conference on Industrial Electronics and Applications (ICIEA)
Place of PublicationUnited States
PublisherIEEE, Institute of Electrical and Electronics Engineers
Number of pages7
ISBN (Print)9781479983896
Publication statusPublished - 2015
EventIEEE Conference on Industrial Electronics and Applications - Crowne Plaza, Auckland, New Zealand
Duration: 15 Jun 201517 Jun 2015


ConferenceIEEE Conference on Industrial Electronics and Applications
Country/TerritoryNew Zealand
Internet address


Dive into the research topics of 'Workflow scheduling on distributed systems'. Together they form a unique fingerprint.

Cite this