Evolutionary Computation Algorithms for Task Scheduling in Distributed Computing

Numerous metaheuristic algorithms have been used to optimize resource allocation challenges in heterogeneous distributed computing systems, such as heterogeneous cloud environments. One such challenge is assigning tasks to available resources based on specific criteria to reduce execution time, improve throughput, and enhance system performance. The research revealed that the majority of studies were based on Computational Intelligence algorithms inspired by natural systems. In this paper, four algorithms from the Evolutionary Algorithms group are evaluated under different loads to provide a comprehensive insight into their performance by applying simulation-based optimization as a research method. The experimental results of our implementation of the Genetic Algorithm, Differential Evolution, Evolution Strategies and Evolutionary Programming are compared considering several performance metrics. Overall results demonstrate that the Evolution Strategies algorithm exhibits the best performance. Potential future research directions and associated challenges are discussed as well.

Authors

Institutions

Publication Details

Published
2025-06-02
DOI
https://doi.org/10.1109/mipro65660.2025.11131764
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Evolutionary Computation Algorithms for Task Scheduling in Distributed Computing

Paula Lončar, P. Loncar
Distributed and Parallel Computing Systems
article

Evolutionary Computation Algorithms for Task Scheduling in Distributed Computing

Paula Lončar, P. Loncar
article en

Abstract

Numerous metaheuristic algorithms have been used to optimize resource allocation challenges in heterogeneous distributed computing systems, such as heterogeneous cloud environments. One such challenge is assigning tasks to available resources based on specific criteria to reduce execution time, improve throughput, and enhance system performance. The research revealed that the majority of studies were based on Computational Intelligence algorithms inspired by natural systems. In this paper, four algorithms from the Evolutionary Algorithms group are evaluated under different loads to provide a comprehensive insight into their performance by applying simulation-based optimization as a research method. The experimental results of our implementation of the Genetic Algorithm, Differential Evolution, Evolution Strategies and Evolutionary Programming are compared considering several performance metrics. Overall results demonstrate that the Evolution Strategies algorithm exhibits the best performance. Potential future research directions and associated challenges are discussed as well.

University of Split (HR)
Openalex Percentile: Top 74%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Evolutionary Computation Algorithms for Task Scheduling in Distributed Computing — Paula Lončar, P. Loncar · (2025) | TGRS Research Map | TGRS