Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Bulletin of Electrical Engineering and Informatics Bulletin of Electrical Engineering and Informatics Bulletin of Electrical Engineering and Informatics
Maslina Abdul Aziz
Universiti Teknologi MARA Malaysia
Computer Science & IT Electrical & Electronics Engineering Engineering

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
Scalable workflow scheduling algorithm for minimizing makespan and failure probability Maslina Abdul Aziz; Izuan Hafez Ninggal
Bulletin of Electrical Engineering and Informatics Vol 8, No 1: March 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (604.63 KB) | DOI: 10.11591/eei.v8i1.1436

Abstract

This paper presents an algorithm called Failure-Aware Workflow Scheduling (FAWS). The proposed algorithm discussed in this paper schedules parallel applications on homogeneous systems without sacrificing the two conflicting objectives: reliability and makespan. The proposed algorithm handles unexpected failure causes rescheduling of the failed task to available resources. In order to analyse the performance of the FAWS algorithm, it will be compared with the popular scheduling algorithm namely Heterogeneous Earliest Finish Time (or HEFT) and Critical Path (CP). A simulation-driven analysis based on realistic workflow application was demonstrated using DAG graph as a continuation of the Layered Workflow Scheduling Algorithm (LWFS). The FAWS algorithm aims to minimize the makespan, increases reliability and therefore boosts the performance of the whole system. A workflow generator was developed to generate large task graphs randomly and scheduled the parallel applications. Based on the simulation results, the proposed algorithm has improved the overall workflow scheduling effectiveness in comparison with existing algorithms.
Scalable workflow scheduling algorithm for minimizing makespan and failure probability Maslina Abdul Aziz; Izuan Hafez Ninggal
Bulletin of Electrical Engineering and Informatics Vol 8, No 1: March 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (857.915 KB) | DOI: 10.11591/eei.v8i1.1436

Abstract

This paper presents an algorithm called Failure-Aware Workflow Scheduling (FAWS). The proposed algorithm discussed in this paper schedules parallel applications on homogeneous systems without sacrificing the two conflicting objectives: reliability and makespan. The proposed algorithm handles unexpected failure causes rescheduling of the failed task to available resources. In order to analyse the performance of the FAWS algorithm, it will be compared with the popular scheduling algorithm namely Heterogeneous Earliest Finish Time (or HEFT) and Critical Path (CP). A simulation-driven analysis based on realistic workflow application was demonstrated using DAG graph as a continuation of the Layered Workflow Scheduling Algorithm (LWFS). The FAWS algorithm aims to minimize the makespan, increases reliability and therefore boosts the performance of the whole system. A workflow generator was developed to generate large task graphs randomly and scheduled the parallel applications. Based on the simulation results, the proposed algorithm has improved the overall workflow scheduling effectiveness in comparison with existing algorithms.
Scalable workflow scheduling algorithm for minimizing makespan and failure probability Maslina Abdul Aziz; Izuan Hafez Ninggal
Bulletin of Electrical Engineering and Informatics Vol 8, No 1: March 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (857.915 KB) | DOI: 10.11591/eei.v8i1.1436

Abstract

This paper presents an algorithm called Failure-Aware Workflow Scheduling (FAWS). The proposed algorithm discussed in this paper schedules parallel applications on homogeneous systems without sacrificing the two conflicting objectives: reliability and makespan. The proposed algorithm handles unexpected failure causes rescheduling of the failed task to available resources. In order to analyse the performance of the FAWS algorithm, it will be compared with the popular scheduling algorithm namely Heterogeneous Earliest Finish Time (or HEFT) and Critical Path (CP). A simulation-driven analysis based on realistic workflow application was demonstrated using DAG graph as a continuation of the Layered Workflow Scheduling Algorithm (LWFS). The FAWS algorithm aims to minimize the makespan, increases reliability and therefore boosts the performance of the whole system. A workflow generator was developed to generate large task graphs randomly and scheduled the parallel applications. Based on the simulation results, the proposed algorithm has improved the overall workflow scheduling effectiveness in comparison with existing algorithms.
Co-Authors Izuan Hafez Ninggal