BAGESS: A Software Module Based on a Genetic Algorithm to Sequentially Order Load-Balancing Evaluation Scenarios Over Smartphone-Based Clusters at the Edge

作     者：Yannibelli, Virginia Hirsch, Matias Toloza, Juan Majchrzak, Tim A. Gronli, Tor-Morten Zunino, Alejandro Mateos, Cristian 

作者机构：ISISTAN UNICEN CONICET RA-7000 Tandil Buenos Aires Argentina Univ Agder Dept Informat Syst N-4630 Kristiansand Norway Kristiania Univ Coll Sch Econ Innovat & Technol N-0107 Oslo Norway 

出 版 物：《IEEE ACCESS》 (IEEE Access)

年 卷 期：2024年第12卷

页      面：145893-145919页

核心收录：

基　　金：CONICET [PIP 11220210100138CO 2022-2024 GI, PIBAA 28720210101298CO 2022-2023] ANPCyT [PICT-2018-03323] 

主　　题：Smart phones Batteries Genetic algorithms Software Urban areas Mathematical models Traveling salesman problems Software algorithms Load modeling Load management Edge computing smartphone profiling benchmarking evolutionary computing 

摘      要：Due to the increasing interest in employing smartphones as first-class citizens in high-performance Edge computing environments, the necessity of software to facilitate the evaluation of load-balancing strategies for smartphone-based clusters has emerged. Regarding this, to select the best strategy for a cluster with m smartphones, usually a number of g candidate strategies are evaluated based on a number of r scenarios that contain these smartphones, which differ in terms of the start battery levels required for these smartphones. Thus, each of the r scenarios must be prepared before evaluating each of the g strategies on each r(i), so that the smartphones have the required start battery levels pre-configured for r(i), which requires discharging or charging smartphones. This leads to a number of e = r & lowast;g scenario preparation events that must be sequentially developed, considering that the time required to develop each event depends on the previous event. Thus, the single-objective problem addressed here implies finding out the sequential order in which the events should be developed, so that the total time required to develop them is minimized. This problem is modeled as the ATSP (Asymmetric Traveling Salesman Problem), since defining the sequential order to develop the events is equivalent to defining the sequential order to visit the cities, and therefore, is an NP-Hard problem. Given the complexity of this problem, the novel software module BAGESS (Battery Aware Green Edge Scenario Sequencer) is proposed, which uses a genetic algorithm for defining the sequential order to develop the events. BAGESS s performance outperforms those of the methods currently used for the problem, reaching significant savings regarding the time required to develop the events in the range [12, 85]%.