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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied artificial intelligence Ročník 35; číslo 15; s. 1567 - 1586
Hlavní autor: Yousif, Adil
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia Taylor & Francis 15.12.2021
Taylor & Francis Ltd
Taylor & Francis Group
Témata:
ISSN:0883-9514, 1087-6545
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract 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.
AbstractList 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.
Author Yousif, Adil
Author_xml – sequence: 1
  givenname: Adil
  orcidid: 0000-0002-7584-5775
  surname: Yousif
  fullname: Yousif, Adil
  email: adiluofk@gmail.com;ayalfaki@nu.edu.sa
  organization: Najran University
BookMark eNqFkd9qFDEYxYNUcFt9BGHA61m__Jtk8MaltLVY8KLrdch8yexmnU1qZpaydz6BD-mTmHHbGy8UAoGTcw6H_M7JWUzRE_KWwpKChvegNW8lFUsGjC5pq5UC_YIsyqOqGynkGVnMnno2vSLn47gDAKoUXZDPq1hdxa2N6F11HbLvh2O1GjYph2m7r_qUq3XY--rXj5_l3G9tLr6bHFy1tuO3Wb7HrXeHIcTNa_Kyt8Po3zzdF-Tr9dX68lN99-Xm9nJ1VyNvGl0j6AY4UtYoBOo0U53lUihl-45T1D22nUSHTLSWacpli6zpey5n3aPiF-T21OuS3ZmHHPY2H02ywfwRUt4Ym6eAgzfgtKet64SSKLSUGpUQ0LVoGwpSQOl6d-p6yOn7wY-T2aVDjmW-YY0oozRns-vDyYU5jWP5JINhslNIcco2DIaCmUmYZxJmJmGeSJS0_Cv9vPl_uY-nXIiFw94-pjw4M9njkHKfC7IwGv7vit_A6aFb
CitedBy_id crossref_primary_10_1007_s10115_023_02048_5
crossref_primary_10_32604_cmes_2025_059786
crossref_primary_10_3390_math12020281
Cites_doi 10.1007/978-1-84882-983-1_15
10.1023/A:1009625629722
10.1007/s10723-018-09472-w
10.1007/s00542-019-04673-z
10.1109/ICCSIT.2010.5564753
10.1007/s13369-014-1558-9
10.1109/ISDA.2006.253921
10.1002/dac.4467
10.1007/978-981-15-0306-1_1
10.1088/1742-6596/1432/1/012061
10.1016/j.jclepro.2019.118869
10.4018/IJDST.2018100102
10.1016/j.ejor.2005.12.024
10.1049/trit.2018.0001
10.1109/CEC.2018.8477765
10.1117/1.2192497
10.1016/j.eswa.2019.112968
10.1007/978-981-10-8681-6_73
10.1016/j.simpat.2020.102228
10.4018/978-1-5225-5832-3.ch015
10.1016/j.simpat.2021.102353
10.1002/cpe.710
10.1016/j.future.2008.02.003
10.1016/j.swevo.2011.06.003
10.1007/978-3-319-02141-6_13
10.1016/j.asoc.2018.05.032
10.1371/journal.pone.0177567
10.1109/STUDENT.2012.6408373
10.14257/ijgdc.2016.9.3.23
10.1016/j.trb.2019.12.004
10.1007/978-3-030-24318-0_77
ContentType Journal Article
Copyright 2021 Taylor & Francis 2021
2021 Taylor & Francis
Copyright_xml – notice: 2021 Taylor & Francis 2021
– notice: 2021 Taylor & Francis
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOA
DOI 10.1080/08839514.2021.1987708
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList

Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1087-6545
EndPage 1586
ExternalDocumentID oai_doaj_org_article_0d8e19db475c48558c7440b9ca610540
10_1080_08839514_2021_1987708
1987708
Genre Research Article
GroupedDBID .4S
.7F
.DC
.QJ
0YH
23M
2DF
30N
4.4
5GY
5VS
8VB
AAENE
AAFWJ
AAJMT
ABCCY
ABDBF
ABFIM
ABHAV
ABIVO
ABPEM
ABTAI
ACGEJ
ACGFS
ACGOD
ACNCT
ACTIO
ACUHS
ADCVX
ADMLS
ADXPE
AEISY
AEMOZ
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFPKN
AGMYJ
AHQJS
AIJEM
AIYEW
AJWEG
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
ARCSS
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
EAP
EBR
EBS
EBU
ECS
EDO
EMK
EPL
EST
ESX
E~A
E~B
F5P
GTTXZ
H13
HF~
HZ~
H~9
H~P
I-F
IPNFZ
J.P
K1G
KYCEM
LJTGL
M4Z
MK~
NA5
NX~
O9-
P2P
PQQKQ
QWB
RIG
S-T
SNACF
TDBHL
TFL
TFW
TH9
TNC
TTHFI
TUS
TWF
UT5
UU3
ZL0
~S~
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
GROUPED_DOAJ
ID FETCH-LOGICAL-c3668-c08603c1267c01d827ba35477afb31c8fc9b5cdc249a281359c26ff35c9b5ec73
IEDL.DBID DOA
ISSN 0883-9514
IngestDate Mon Nov 10 04:33:32 EST 2025
Mon Jun 30 04:11:46 EDT 2025
Sat Nov 29 03:21:25 EST 2025
Tue Nov 18 21:52:34 EST 2025
Mon Oct 20 23:47:56 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 15
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3668-c08603c1267c01d827ba35477afb31c8fc9b5cdc249a281359c26ff35c9b5ec73
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-7584-5775
OpenAccessLink https://doaj.org/article/0d8e19db475c48558c7440b9ca610540
PQID 2644778320
PQPubID 53050
PageCount 20
ParticipantIDs crossref_primary_10_1080_08839514_2021_1987708
proquest_journals_2644778320
informaworld_taylorfrancis_310_1080_08839514_2021_1987708
doaj_primary_oai_doaj_org_article_0d8e19db475c48558c7440b9ca610540
crossref_citationtrail_10_1080_08839514_2021_1987708
PublicationCentury 2000
PublicationDate 12/15/2021
PublicationDateYYYYMMDD 2021-12-15
PublicationDate_xml – month: 12
  year: 2021
  text: 12/15/2021
  day: 15
PublicationDecade 2020
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle Applied artificial intelligence
PublicationYear 2021
Publisher Taylor & Francis
Taylor & Francis Ltd
Taylor & Francis Group
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
– name: Taylor & Francis Group
References DE ROURE D. (cit0007) 2003; 13
cit0033
cit0012
cit0034
cit0031
cit0010
cit0030
Khan S. U. (cit0014) 2012
Wang Q. (cit0032) 2006
ZHENG S. (cit0043) 2006
cit0019
cit0017
cit0039
cit0015
cit0037
cit0016
SINHA P. (cit0028) 2019
cit0013
cit0035
cit0036
cit0022
cit0001
cit0023
cit0020
cit0042
cit0021
cit0040
cit0041
YOUSIF A. (cit0038) 2011; 33
Pooranian Z. (cit0018) 2011
cit0008
cit0009
cit0006
cit0029
cit0004
cit0026
cit0005
cit0027
cit0002
cit0024
cit0003
GHOSH T. K. (cit0011) 2019
cit0025
References_xml – ident: cit0034
  doi: 10.1007/978-1-84882-983-1_15
– volume: 33
  start-page: 155
  year: 2011
  ident: cit0038
  publication-title: Journal of Theoretical and Applied Information Technology
– ident: cit0030
  doi: 10.1023/A:1009625629722
– start-page: 705
  volume-title: IMSCCS’06. First International Multi-Symposiums on
  year: 2006
  ident: cit0032
– volume: 13
  start-page: 14
  year: 2003
  ident: cit0007
  publication-title: Making the Global Infrastructure a Reality
– ident: cit0015
  doi: 10.1007/s10723-018-09472-w
– start-page: 873
  volume-title: International Conference on Information Technology and Applied Mathematics
  year: 2019
  ident: cit0011
– ident: cit0016
  doi: 10.1007/s00542-019-04673-z
– ident: cit0008
  doi: 10.1109/ICCSIT.2010.5564753
– ident: cit0022
  doi: 10.1007/s13369-014-1558-9
– ident: cit0042
  doi: 10.1109/ISDA.2006.253921
– ident: cit0026
  doi: 10.1002/dac.4467
– ident: cit0009
  doi: 10.1007/978-981-15-0306-1_1
– start-page: 387
  volume-title: Intelligent communication technologies and virtual mobile networks
  year: 2019
  ident: cit0028
– ident: cit0003
  doi: 10.1088/1742-6596/1432/1/012061
– ident: cit0025
  doi: 10.1016/j.jclepro.2019.118869
– ident: cit0002
  doi: 10.4018/IJDST.2018100102
– ident: cit0029
  doi: 10.1016/j.ejor.2005.12.024
– ident: cit0033
  doi: 10.1049/trit.2018.0001
– ident: cit0037
  doi: 10.1109/CEC.2018.8477765
– ident: cit0021
– ident: cit0006
  doi: 10.1117/1.2192497
– ident: cit0017
  doi: 10.1016/j.eswa.2019.112968
– ident: cit0020
  doi: 10.1007/978-981-10-8681-6_73
– ident: cit0031
  doi: 10.1016/j.simpat.2020.102228
– start-page: 316
  volume-title: Innovative Computing, Information and Control, 2006. ICICIC’06. First International Conference on
  year: 2006
  ident: cit0043
– ident: cit0010
  doi: 10.4018/978-1-5225-5832-3.ch015
– ident: cit0027
  doi: 10.1016/j.simpat.2021.102353
– ident: cit0004
  doi: 10.1002/cpe.710
– ident: cit0013
  doi: 10.1016/j.future.2008.02.003
– ident: cit0023
  doi: 10.1016/j.swevo.2011.06.003
– ident: cit0041
– ident: cit0035
  doi: 10.1109/CEC.2018.8477765
– ident: cit0040
  doi: 10.1007/978-3-319-02141-6_13
– ident: cit0036
  doi: 10.1016/j.asoc.2018.05.032
– ident: cit0012
  doi: 10.1371/journal.pone.0177567
– start-page: 327
  volume-title: Proceedings of International Conference on Future Information Technology
  year: 2011
  ident: cit0018
– ident: cit0039
  doi: 10.1109/STUDENT.2012.6408373
– ident: cit0001
  doi: 10.14257/ijgdc.2016.9.3.23
– ident: cit0005
– ident: cit0024
  doi: 10.1016/j.trb.2019.12.004
– year: 2012
  ident: cit0014
  publication-title: Information Sciences 214: 1-19
– ident: cit0019
  doi: 10.1007/978-3-030-24318-0_77
SSID ssj0001771
Score 2.2734106
Snippet Grid computing is a computational paradigm that emerged to ‎‎handle the increasing demand for ‎computational resources. Several metaheuristics methods ‎‎have...
SourceID doaj
proquest
crossref
informaworld
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1567
SubjectTerms Algorithms
Computational grids
Genetic algorithms
Heuristic methods
Permutations
Scheduling
Tabu search
Task scheduling
SummonAdditionalLinks – databaseName: Taylor & Francis Online Journals
  dbid: TFW
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1La9wwEBYl9NBL82hCt02KDrk6tSzr4eM2ZFsohEC3NDeh52bJ1hvsbSG3_oL-yP6SaLTy0gchhxR8sdAIeTwzmhEz3yB0DFVnnAdeiMpVRe20KaQjrNDMce589DiESc0mxPm5vLxsLnI2YZ_TKiGGDmugiGSrQbm16YeMuLdRMWh0DOBGpCInEDWLVO4bj35Qzenky8YWE5FCLqAogGSo4blvlT9OpwTi_xeE6T8mO51Dk-3_8AU76Hl2QvF4LTW76Ilv99D20OABZ31_gT6OW3zWXqUkATyJxjEsbvF4MVt289XVVxz3i6GEBP_68TM-gP0c573v5g5PdX8Nw5-iTDhIdp_to8-Ts-nphyJ3Xygs5VwWNgY7JbWk4sKWxMlKGE1ZLYQOhhIrg20Ms87G-E1XklDW2IqHQBmMeyvoAdpql61_ibCsZVULykvPfB0XNYx67rjTNDAaDB-heuC6shmaHDpkLBQZEEwzwxQwTGWGjdDJhuxmjc3xEME7-KWbyQCtnQaW3UxlTVWlk540ztSCWUDOkRYwFE1jdfQ0o387Qs3vAqFW6WYlrNugKPrABg4H6VHZVvQKXFIhomUtXz1i6dfoGbxCpg1hh2hr1X3zR-ip_b6a992bpBV3HSUGTQ
  priority: 102
  providerName: Taylor & Francis
Title An Enhanced Firefly Algorithm for Time ‎‎Shared Grid Task ‎Scheduling
URI https://www.tandfonline.com/doi/abs/10.1080/08839514.2021.1987708
https://www.proquest.com/docview/2644778320
https://doaj.org/article/0d8e19db475c48558c7440b9ca610540
Volume 35
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor and Francis Online Journals
  customDbUrl:
  eissn: 1087-6545
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001771
  issn: 0883-9514
  databaseCode: TFW
  dateStart: 19870101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NTtwwELYQ4sClhULVLRT50GsgjuOfHJeKBakSQuoiuFnxH6y6DdXugtRbn4CH5EmYSRy0gsNekKIcRnZizYzHM4n9fYR8x1NnUkaZqcIXWelrm2nPRFYLL6UPkHEo25JNqPNzfX1dXSxRfeGesA4euFPcUe51YJW3pRIOgUy0Q0g7W7kaFn5INzD65qrqi6kUg5lqSy2YQjyDHKLsz-4gqjbIUAS1YcEOseZWyC25tCq14P2voEvfhOp2_RltkQ8pcaTDbsDbZC00n8jHnpSBpjm6Q34OG3rS3LY_9ukIAlqc_qPD6c3dbLK4_UPhXRSPfdCn_49wIV4ztDudTTwd1_PfKP4FdvS4Qf1ml1yOTsY_zrLEmJA5LqXOHBQoOXeskMrlzOtC2ZqLUqk6Ws6cjq6ywnkHNVddaMZF5QoZIxcoD07xz2S9uWvCF0J1qYtScZkHEUp4qBU8SC99zaPg0coBKXuNGZfgxJHVYmpYjzqaFG1Q0SYpekAOX7r97fA0VnU4RnO8NEY47FYATmKSk5hVTjIg1bIxzaL9GhI76hLDVwxgv7e8SfN7bjCNVAqiYf71Pca3RzbxlbhNhol9sr6Y3YdvZMM9LCbz2UHr2nAfj66eAXHK9eI
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NbhMxELZQi1QutFAQoSn4wHXDer3-2WOokgal5EJQc7PWf2lE2KBNQOLGE_Qh-yR4nN2ogKoeQNqT12N5Z2fGM9bMNwi9gaozzj1PRGazJLelTqQlLCmZ5dy64HEIHZtNiMlEzmbF7VoYSKuEGNpvgSKirQblhsvoNiXubdAMGjwDuBLJSA_CZgH1vvssnLWAnz8dXu6sMREx6AKSBGjaKp67lvntfIow_n-AmP5ltONJNDz8H99whB43fijubwXnCXrgqqfosO3xgBuVP0bjfoUH1VXME8DDYB_98gfuL-ererG5-oLDhjFUkeCbn9fhAfjnMO-8Xlg8LdefYfhjEAsL-e7zZ-jTcDA9GyVNA4bEUM5lYkK8k1JDMi5MSqzMhC4py4UovabESG8KzYw1IYQrM0koK0zGvacMxp0R9Dnaq1aVe4GwzGWWC8pTx1weFtWMOm65Laln1GveQXnLdmUadHJokrFUpAUxbRimgGGqYVgH9XZkX7fwHPcRvIN_upsM6NpxYFXPVaOsKrXSkcLqXDAD4DnSAIyiLkwZnM3g4nZQcVsi1CZervhtJxRF79lAtxUf1ZiLtQKvVIhgXNOX_7D0a3Qwmn64UBfvJ-MT9AheQeINYV20t6m_uVP00HzfLNb1q6givwC-8wp3
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELaqtkJcKOUhFgr1gWtKHMePHLfQQFW0qsRW9GbFr-2KJVtlFyRu_IL-yP4SPF5nBUWoByrl5HgsZzIznrFmvkHoNVSdce55JgpbZKVtdCYtYVnDLOfWBY9D6NhsQoxG8vy8Ok3ZhIuUVgkxtF8BRURbDcp9aX2fEfcmKAYNjgHciBTkAKJmAeW-W8F15iDk4_rz2hgTEWMuIMmApi_i-dcyfxxPEcX_BobpXzY7HkT1zh18wkP0IHmheLgSm1204dpHaKfv8ICTwj9GJ8MWH7UXMUsA18E6-tkPPJxN5t10efEVh_1iqCHB1z-vwgPgz2He-25q8bhZfIHhT0EoLGS7T56gs_po_PZDltovZIZyLjMTop2cGlJwYXJiZSF0Q1kpROM1JUZ6U2lmrAkBXFNIQlllCu49ZTDujKBP0WY7b90zhGUpi1JQnjvmyrCoZtRxy21DPaNe8wEqe64rk7DJoUXGTJEewjQxTAHDVGLYAB2syS5X4By3ERzCL11PBmztODDvJiqpqsqtdKSyuhTMAHSONACiqCvTBFczOLgDVP0uEGoZr1b8qg-KordsYK-XHpWMxUKBTypEMK358_9Yeh_dO31Xq4_Ho5MX6D68gawbwvbQ5rL75l6ibfN9OV10r6KC_AKInQkp
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Enhanced+Firefly+Algorithm+for+Time+%E2%80%8E%E2%80%8EShared+Grid+Task+%E2%80%8EScheduling&rft.jtitle=Applied+artificial+intelligence&rft.au=Adil+Yousif&rft.date=2021-12-15&rft.pub=Taylor+%26+Francis+Group&rft.issn=0883-9514&rft.eissn=1087-6545&rft.volume=35&rft.issue=15&rft.spage=1567&rft.epage=1586&rft_id=info:doi/10.1080%2F08839514.2021.1987708&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_0d8e19db475c48558c7440b9ca610540
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0883-9514&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0883-9514&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0883-9514&client=summon