Greedy-Ant: Ant Colony System-Inspired Workflow Scheduling for Heterogeneous Computing
The last decades have seen a considerable progress on workflow scheduling in heterogeneous computing environments. However, existing methods still need to be improved on the performance in the makespan-based metrics. This paper proposes a novel workflow scheduling algorithm named Greedy-Ant to minim...
Main Authors: | Bin Xiang, Bibo Zhang, Lin Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2017-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/7954970/ |
Similar Items
-
Using ant colonies for solve the multiprocessor task graph scheduling
by: Bremang, Appah
Published: (2006) -
Scalable workflow scheduling algorithm for minimizing makespan and failure probability
by: Aziz, M.A, et al.
Published: (2019) -
An Ant Colony Inspired Cache Allocation Mechanism for Heterogeneous Information Centric Network
by: Ping Zhou, et al.
Published: (2021-01-01) -
A Multi-Objective Optimization Scheduling Method Based on the Ant Colony Algorithm in Cloud Computing
by: Liyun Zuo, et al.
Published: (2015-01-01) -
Bio-Inspired Workflow Scheduling on HPC Platforms
by: Mandeep Kaur*, et al.
Published: (2021-01-01)