A Fast and Energy-Efficient Method for Online and Incremental Pareto-Front Update

• Type: Article in International Conference Proceedings Book
• Date: 2024

Authors

Ferreira, PJS (Author) Other; João Mendes-Moreira (Author) FEUP; João M. P. Cardoso (Author) FEUP

Conference proceedings International

Title: 10th IEEE World Forum on Internet of Things, WF-IoT 2024, Ottawa, ON, Canada, November 10-13, 2024

Pages: 1-6

10th IEEE World Forum on Internet of Things, WF-IoT 2024

Ottawa, 10 November 2024 through 13 November 2024

Indexing

Scopus - 0 Citations

Other information

Authenticus ID: P-017-Y5Z

DOI: 10.1109/wf-iot62078.2024.10811392

Abstract (EN): Self-adaptive Systems (SaS) are becoming increasingly important for adapting to dynamic environments and for optimizing performance on resource-constrained devices. A practical approach to achieving self-adaptability involves using a Pareto-Front (PF) to store the system's hyper-parameters and the outcomes of hyperparameter combinations. This paper proposes a novel method to approximate a PF, offering a configurable number of solutions that can be adapted to the device's limitations. We conducted extensive experiments across various scenarios, where all PF solutions were replaced, and real world scenarios were performed using actual measurements from a Human Activity Recognition (HAR) system. Our results show that our method consistently outperforms previous methods, mainly when the maximum number of PF solutions is in the order of hundreds. The effectiveness of our method is most apparent in real-case scenarios where it achieves, when executed in a Raspberry Pi 5, up to 87% energy consumption reduction and lower execution times than the second-best algorithm. Additionally, our method ensures a more evenly distributed solution across the PF, preventing the high concentration of solutions. © 2024 IEEE.

Language: English

Type (Professor's evaluation): Scientific