Scalable workflow scheduling algorithm for minimizing makespan and failure probability

• Published in: Bulletin of Electrical Engineering and Informatics
• Main Author: Aziz M.A.; Ninggal I.H.
• Format: Article
• Language: English
• Published: Institute of Advanced Engineering and Science 2019
• Online Access: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85065247896&doi=10.11591%2feei.v8i1.1436&partnerID=40&md5=f21d343ca0b5b2403e05f5055294f3a5

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. © 2019 Institute of Advanced Engineering and Science.