Umeå University's logo

umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
ECFA: an efficient convergent firefly algorithm for solving task scheduling problems in cloud-edge computing
School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 Xiaolingwei Street, Nanjing, China.
School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 Xiaolingwei Street, Nanjing, China.
School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 Xiaolingwei Street, Nanjing, China.
Umeå University, Faculty of Science and Technology, Department of Applied Physics and Electronics.ORCID iD: 0000-0003-4228-2774
Show others and affiliations
2023 (English)In: IEEE Transactions on Services Computing, E-ISSN 1939-1374, p. 1-14Article in journal (Refereed) Published
Abstract [en]

In cloud-edge computing paradigms, the integration of edge servers and task offloading mechanisms has posed new challenges to developing task scheduling strategies. This paper proposes an efficient convergent firefly algorithm (ECFA) for scheduling security-critical tasks onto edge servers and the cloud datacenter. The proposed ECFA uses a probability-based mapping operator to convert an individual firefly into a scheduling solution, in order to associate the firefly space with the solution space. Distinct from the standard FA, ECFA employs a low-complexity position update strategy to enhance computational efficiency in solution exploration. In addition, we provide a rigorous theoretical analysis to justify that ECFA owns the capability of converging to the global best individual in the firefly space. Furthermore, we introduce the concept of boundary traps for analyzing firefly movement trajectories, and investigate whether ECFA would fall into boundary traps during the evolutionary procedure under different parameter settings. We create various testing instances to evaluate the performance of ECFA in solving the cloud-edge scheduling problem, demonstrating its superiority over FA-based and other competing metaheuristics. Evaluation results also validate that the parameter range derived from the theoretical analysis can prevent our algorithm from falling into boundary traps.

Place, publisher, year, edition, pages
IEEE, 2023. p. 1-14
Keywords [en]
Cloud computing, cloud-edge computing, Convergence, convergence proof, firefly algorithm, Processor scheduling, Scheduling, Servers, Task analysis, task scheduling, Trajectory, trajectory analysis
National Category
Computer Sciences Computer Systems
Identifiers
URN: urn:nbn:se:umu:diva-212325DOI: 10.1109/TSC.2023.3293048Scopus ID: 2-s2.0-85164678733OAI: oai:DiVA.org:umu-212325DiVA, id: diva2:1783963
Funder
The Kempe FoundationsAvailable from: 2023-07-25 Created: 2023-07-25 Last updated: 2024-04-26Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Gu, Zonghua

Search in DiVA

By author/editor
Gu, Zonghua
By organisation
Department of Applied Physics and Electronics
In the same journal
IEEE Transactions on Services Computing
Computer SciencesComputer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 67 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf