Deakin University
Browse

File(s) under permanent embargo

Workflow scheduling on distributed systems

Version 2 2024-06-03, 11:54
Version 1 2016-03-11, 17:11
conference contribution
posted on 2024-06-03, 11:54 authored by M 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

Pagination

683-689

Location

Auckland, New Zealand

Start date

2015-06-15

End date

2015-06-17

ISBN-13

9781479983896

Language

eng

Publication classification

E Conference publication, E1 Full written paper - refereed

Copyright notice

2015, IEEE

Extent

ICIEA 2015: Proceedings of the 10th IEEE conference on Industrial Electronics and Applications

Title of proceedings

ICIEA 2015: Proceedings of the 10th IEEE conference on Industrial Electronics and Applications

Event

IEEE Conference on Industrial Electronics and Applications (10th : 2015 : Auckland, New Zealand)

Publisher

IEEE

Place of publication

Piscataway, N.J.

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC