|
|
 |
| |
|
|
|
An Efficient Firefly Algorithm for Optimizing Task Scheduling in Cloud Computing Systems |
|
|
|
PP: 1637-1647 |
|
|
|
doi:10.18576/isl/120348
|
|
|
|
Author(s) |
|
|
|
Ahmed Y. Hamed,
M. Kh. Elnahary,
Hamdy H. El-Sayed,
Louai Maghrabi,
|
|
|
|
Abstract |
|
|
| As user service demands change constantly, task scheduling becomes an extremely significant study area within the cloud environment. The goal of scheduling is distributing the tasks on available processors in order to achieve the shortest possible makespan while adhering to priority constraints. In heterogeneous cloud computing resources, task scheduling has a large influence on system performances. The various processes in the heuristic-based algorithm of scheduling will result in varied makespans when heterogeneous resources are utilized. As a result, a smart method of scheduling must be capable of establishing precedence efficacy for each task to decrease makespan time. In our study, we develop a novel efficient method of scheduling tasks according to the firefly algorithm to tackle an essential task and schedule a heterogeneous cloud computing problem. We evaluate the performance of our algorithm by putting it through three situations with changing amounts of processors and numbers of tasks. The findings of the experiment reveal that our suggested technique found optimal solutions substantially more frequently in terms of makespan time when compared with other methods.
|
|
|
|
|
|
|
|
