Workflow scheduling on distributed systems

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

Workflow scheduling on distributed systems

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

Research output: Book chapter/Published conference paper › Conference paper › peer-review

1 Citation (Scopus)

6 Downloads (Pure)

Abstract

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 language	English
Title of host publication	Proceedings of the 2015 IEEE 10th Conference on Industrial Electronics and Applications (ICIEA)
Place of Publication	United States
Publisher	IEEE, Institute of Electrical and Electronics Engineers
Pages	683-689
Number of pages	7
ISBN (Print)	9781479983896
Publication status	Published - 2015
Event	IEEE Conference on Industrial Electronics and Applications - Crowne Plaza, Auckland, New Zealand Duration: 15 Jun 2015 → 17 Jun 2015 http://www.ieeeiciea.org/2015/

Conference

Conference	IEEE Conference on Industrial Electronics and Applications
Country/Territory	New Zealand
City	Auckland
Period	15/06/15 → 17/06/15
Internet address	http://www.ieeeiciea.org/2015/

Cite this

@inproceedings{bef635dc1b20408592674d2e691380dd,

title = "Workflow scheduling on distributed systems",

abstract = "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.",

author = "Aziz, {Maslina Abdul} and Jemal Abawajy and Islam, {MD Rafiqul} and Tutut Herawan",

note = "Imported on 03 May 2017 - DigiTool details were: publisher = USA: IEEE, 2015. Event dates (773o) = 15-17 June 2015; Parent title (773t) = IEEE Conference on Industrial Electronics and Applications.; IEEE Conference on Industrial Electronics and Applications ; Conference date: 15-06-2015 Through 17-06-2015",

year = "2015",

language = "English",

isbn = "9781479983896",

pages = "683--689",

booktitle = "Proceedings of the 2015 IEEE 10th Conference on Industrial Electronics and Applications (ICIEA)",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

address = "United States",

url = "http://www.ieeeiciea.org/2015/",

}

Aziz, MA, Abawajy, J, Islam, MDR & Herawan, T 2015, Workflow scheduling on distributed systems. in Proceedings of the 2015 IEEE 10th Conference on Industrial Electronics and Applications (ICIEA). IEEE, Institute of Electrical and Electronics Engineers, United States, pp. 683-689, IEEE Conference on Industrial Electronics and Applications, Auckland, New Zealand, 15/06/15.

Workflow scheduling on distributed systems. / Aziz, Maslina Abdul; Abawajy, Jemal; Islam, MD Rafiqul et al.
Proceedings of the 2015 IEEE 10th Conference on Industrial Electronics and Applications (ICIEA). United States: IEEE, Institute of Electrical and Electronics Engineers, 2015. p. 683-689.

Research output: Book chapter/Published conference paper › Conference paper › peer-review

TY - GEN

T1 - Workflow scheduling on distributed systems

AU - Aziz, Maslina Abdul

AU - Abawajy, Jemal

AU - Islam, MD Rafiqul

AU - Herawan, Tutut

N1 - Imported on 03 May 2017 - DigiTool details were: publisher = USA: IEEE, 2015. Event dates (773o) = 15-17 June 2015; Parent title (773t) = IEEE Conference on Industrial Electronics and Applications.

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

M3 - Conference paper

SN - 9781479983896

SP - 683

EP - 689

BT - Proceedings of the 2015 IEEE 10th Conference on Industrial Electronics and Applications (ICIEA)

PB - IEEE, Institute of Electrical and Electronics Engineers

CY - United States

T2 - IEEE Conference on Industrial Electronics and Applications

Y2 - 15 June 2015 through 17 June 2015

ER -

Workflow scheduling on distributed systems

Abstract

Conference

Fingerprint

Cite this