An Enhanced Firefly Algorithm for Time ‎‎Shared Grid Task ‎Scheduling

Grid computing is a computational paradigm that emerged to ‎‎handle the increasing demand for ‎computational resources. Several metaheuristics methods ‎‎have been applied ‎to tackle the grid task scheduling problem. ‎‎These metaheuristics generally generate good but not optimal ‎‎task ‎schedules. Th...

Full description

Saved in:
Bibliographic Details
Published in:Applied artificial intelligence Vol. 35; no. 15; pp. 1567 - 1586
Main Author: Yousif, Adil
Format: Journal Article
Language:English
Published: Philadelphia Taylor & Francis 15.12.2021
Taylor & Francis Ltd
Taylor & Francis Group
Subjects:
ISSN:0883-9514, 1087-6545
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Grid computing is a computational paradigm that emerged to ‎‎handle the increasing demand for ‎computational resources. Several metaheuristics methods ‎‎have been applied ‎to tackle the grid task scheduling problem. ‎‎These metaheuristics generally generate good but not optimal ‎‎task ‎schedules. The aim of this paper is to design and ‎‎implement a grid task scheduling mechanism to map clients' tasks to ‎‎ ‎available resources in order to finish the submitted tasks ‎‎within the optimal execution time. The paper proposes ‎an ‎‎enhanced time shared metaheuristics mechanism based on ‎‎Firefly Algorithm to ‎‎improve the grid job scheduling process. The proposed mechanism utilizes the Smallest Position ‎Value (SPV) technique to handle the scheduling problem as ‎permutations. Experiments using ‎‎simulations and real workload traces were ‎conducted to study ‎‎the performance of the proposed enhanced time shared ‎‎metaheuristic scheduling mechanism. ‎Empirical results revealed ‎‎that the proposed timed shared ‎metaheuristic algorithm can efficiently reduce the makespan time to 1851 compared with 3482, 3185 for Tabu search and genetic algorithm, respectively.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0883-9514
1087-6545
DOI:10.1080/08839514.2021.1987708