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...
Saved in:
Main Authors: | Abdul Aziz, Maslina, Ninggal, Izuan Hafez |
---|---|
Format: | Article |
Language: | English English |
Published: |
Universitas Ahmad Dahlan
2019
|
Online Access: | 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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An efficient VM scheduling algorithm to minimize the makespan and maximize the profit
by: Ibrahim, Aws Fadhil
Published: (2019) -
Tasks scheduling technique using league championship algorithm for makespan minimization in IaaS cloud
by: Abdulhamid, Shafi’i Muhammad, et al.
Published: (2014) -
Online scheduling in minimizing makespan on identical parallel processor with release date
by: Nordin, Syarifah Zyurina, et al.
Published: (2014) -
Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms
by: Mohd Ariffin, Mohd Khairol Anuar, et al.
Published: (2015) -
Minimize the makespan for job shop scheduling problem using artificial immune system approach
by: Muhamad, A. S., et al.
Published: (2015)