A Comparison of Synchronous and Asynchronous Distributed Particle Swarm Optimization for Edge Computing

被引:5
|
作者
Busetti, Riccardo [1 ]
El Ioini, Nabil [1 ]
Barzegar, Hamid R. [1 ]
Pahl, Claus [1 ]
机构
[1] Free Univ Bozen Bolzano, Bolzano, Italy
来源
PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND SERVICES SCIENCE, CLOSER 2023 | 2023年
关键词
Edge Cloud; Optimization; Particle Swarm Optimization; Distributed PSO; Synchronous PSO; Apache Spark; Kubernetes; Docker;
D O I
10.5220/0011815500003488
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Edge computing needs to deal with concerns such as load balancing, resource provisioning, and workload placement as optimization problems. Particle Swarm Optimization (PSO) is a nature-inspired stochastic optimization approach that aims at iteratively improving a solution of a problem over a given objective. Utilising PSO in a distributed edge setting would allow the transfer of resource-intensive computational tasks from a central cloud to the edge, this providing a more efficient use of existing resources. However, there are challenges to meet performance and fault tolerance targets caused by the resource-constrained edge environment with a higher probability of faults. We introduce here distributed synchronous and asynchronous variants of the PSO algorithm. These two forms specifically target the performance and fault tolerance requirements in an edge network. The PSO algorithms distribute the load across multiple nodes in order to effectively realize coarse-grained parallelism, resulting in a significant performance increase.
引用
收藏
页码:194 / 203
页数:10
相关论文
共 50 条
  • [41] Particle Swarm Optimization Algorithm for Detecting Distributed Predicates
    Al Maghayreh, Eslam
    Dhahiri, Habib
    Albogamy, Fahad
    Al Rahhal, Mohamad Mahmoud
    Mahmood, Awais
    Othman, Esam
    Elkilani, Wail S.
    IEEE ACCESS, 2021, 9 : 105286 - 105296
  • [42] Asynchronous parallelization of particle swarm optimization through digital pheromone sharing
    Vijay K. Kalivarapu
    Eliot H. Winer
    Structural and Multidisciplinary Optimization, 2009, 39 : 263 - 281
  • [43] Multiuser detection for asynchronous multicarrier CDMA using particle swarm optimization
    Zubair, Muhammad
    Choudhry, Muhammad A. S.
    Naveed, Aqdas
    Qureshi, Ijaz Mansoor
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2008, E91B (05) : 1636 - 1639
  • [44] Parallel scalable hardware implementation of asynchronous discrete particle swarm optimization
    Farmahini-Farahani, Amin
    Vakili, Shervin
    Fakhraie, Sied Mehdi
    Safari, Saeed
    Lucas, Caro
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2010, 23 (02) : 177 - 187
  • [45] Cooperative Asynchronous Parallel Particle Swarm Optimization for Large Dimensional Problems
    Bourennani, Farid
    INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING, 2019, 10 (03) : 19 - 38
  • [46] Synchronous set-based particle swarm optimization: Heuristics for portfolio optimization
    Lakhmani, Ashish
    Thulasiram, Ruppa K.
    Thulasiraman, Parimala
    2024 IEEE 48TH ANNUAL COMPUTERS, SOFTWARE, AND APPLICATIONS CONFERENCE, COMPSAC 2024, 2024, : 1806 - 1812
  • [47] Applying Improved Particle Swarm Optimization to Asynchronous Parallel Disassembly Planning
    Tseng, Hwai-En
    Chang, Chien-Cheng
    Chung, Ting-Wei
    IEEE ACCESS, 2022, 10 : 80555 - 80564
  • [48] Asynchronous parallelization of particle swarm optimization through digital pheromone sharing
    Kalivarapu, Vijay K.
    Winer, Eliot H.
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2009, 39 (03) : 263 - 281
  • [49] Improvement of Particle Swarm Optimization Focusing on Diversity of the Particle Swarm
    Hayashida, Tomohiro
    Nishizaki, Ichiro
    Sekizaki, Shinya
    Takamori, Yuki
    2020 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2020, : 191 - 197
  • [50] Particle Swarm Based Service Migration Scheme in the Edge Computing Environment
    Liang, Liang
    Xiao, Jintao
    Ren, Zhi
    Chen, Zhengchuan
    Jia, Yunjian
    IEEE ACCESS, 2020, 8 (08): : 45596 - 45606