صورة الغلاف

Scalable workflow scheduling algorithm for minimizing makespan and failure probability

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

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلفون الرئيسيون: Abdul Aziz, Maslina, Ninggal, Izuan Hafez
التنسيق: مقال
اللغة:English
English
منشور في: Universitas Ahmad Dahlan 2019
الوصول للمادة أونلاين:http://psasir.upm.edu.my/id/eprint/82061/1/Scalable%20workflow%20scheduling%20algorithm%20for%20minimizing%20makespan%20and%20failure%20probability.pdf
http://psasir.upm.edu.my/id/eprint/82061/3/Scalable%20workflow%20.pdf
http://psasir.upm.edu.my/id/eprint/82061/
https://beei.org/index.php/EEI/article/view/1436
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
id my.upm.eprints.82061
record_format eprints
spelling my.upm.eprints.820612021-09-08T19:20:21Z http://psasir.upm.edu.my/id/eprint/82061/ Scalable workflow scheduling algorithm for minimizing makespan and failure probability Abdul Aziz, Maslina Ninggal, Izuan Hafez 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. Universitas Ahmad Dahlan 2019 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/82061/1/Scalable%20workflow%20scheduling%20algorithm%20for%20minimizing%20makespan%20and%20failure%20probability.pdf text en http://psasir.upm.edu.my/id/eprint/82061/3/Scalable%20workflow%20.pdf Abdul Aziz, Maslina and Ninggal, Izuan Hafez (2019) Scalable workflow scheduling algorithm for minimizing makespan and failure probability. Bulletin of Electrical Engineering and Informatics, 8 (1). pp. 283-290. ISSN 2089-3191; ESSN: 2302-9285 https://beei.org/index.php/EEI/article/view/1436 10.11591/eei.v8i1.1436
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
English
description 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.
format Article
author Abdul Aziz, Maslina
Ninggal, Izuan Hafez
spellingShingle Abdul Aziz, Maslina
Ninggal, Izuan Hafez
Scalable workflow scheduling algorithm for minimizing makespan and failure probability
author_facet Abdul Aziz, Maslina
Ninggal, Izuan Hafez
author_sort Abdul Aziz, Maslina
title Scalable workflow scheduling algorithm for minimizing makespan and failure probability
title_short Scalable workflow scheduling algorithm for minimizing makespan and failure probability
title_full Scalable workflow scheduling algorithm for minimizing makespan and failure probability
title_fullStr Scalable workflow scheduling algorithm for minimizing makespan and failure probability
title_full_unstemmed Scalable workflow scheduling algorithm for minimizing makespan and failure probability
title_sort scalable workflow scheduling algorithm for minimizing makespan and failure probability
publisher Universitas Ahmad Dahlan
publishDate 2019
url http://psasir.upm.edu.my/id/eprint/82061/1/Scalable%20workflow%20scheduling%20algorithm%20for%20minimizing%20makespan%20and%20failure%20probability.pdf
http://psasir.upm.edu.my/id/eprint/82061/3/Scalable%20workflow%20.pdf
http://psasir.upm.edu.my/id/eprint/82061/
https://beei.org/index.php/EEI/article/view/1436
_version_ 1710677154528755712
score 13.250246

مواد مشابهة