A New Hybrid Algorithm Based on Improved MODE and PF Neighborhood Search for Scheduling Task Graphs in Heterogeneous Distributed Systems
Multi-objective task graph scheduling is a well-known NP-hard problem that plays a significant role in heterogeneous distributed systems. The solution to the problem is expected to optimize all scheduling objectives. Pretty large state-of-the-art algorithms exist in the literature that mostly apply...
Main Authors: | Nasser Lotfi, Mazyar Ghadiri Nejad |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-07-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/13/14/8537 |
Similar Items
-
Solving a multicriteria scheduling problem using a genetic algorithm
by: Alina Kazmirchuk, et al.
Published: (2021-02-01) -
A FAST AND ELITIST BI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR SCHEDULING INDEPENDENT TASKS ON HETEROGENEOUS SYSTEMS
by: G.Subashini, et al.
Published: (2010-07-01) -
A Pareto-based Optimizer for Workflow Scheduling in Cloud Computing Environment
by: Azade Khalili, et al.
Published: (2016-03-01) -
Gemini: An Adaptive Performance-Fairness Scheduler for Data-Intensive Cluster Computing
by: Niu, Zhaojie, et al.
Published: (2016) -
A Study on Heuristic Task Scheduling Optimizing Task Deadline Violations in Heterogeneous Computational Environments
by: Bo Wang, et al.
Published: (2020-01-01)