Title: A distributed and energy-efficient KNN for EEG classification with dynamic money-saving policy in heterogeneous clusters

Authors: Juan José Escobar, Francisco Rodríguez, Beatriz Prieto, Dragi Kimovski, Andrés Ortiz, and Miguel Damas

Abstract: Due to energy consumption’s increasing importance in recent years, energy-time efficiency is a highly relevant objective to address in High-Performance Computing (HPC) systems, where cost significantly impacts the tasks executed. Among these tasks, classification problems are considered due to their great computational complexity, which is sometimes aggravated when processing high-dimensional datasets. In addition, implementing efficient applications for high-performance systems is not an easy task since hardware must be considered to maximize performance, especially on heterogeneous platforms with multi-core CPUs. Thus, this article proposes an efficient distributed K-Nearest Neighbors (KNN) for Electroencephalogram (EEG) classification that uses minimum Redundancy Maximum Relevance (mRMR) as a feature selection technique to reduce the dimensionality of the dataset. The approach implements an energy policy that can stop or resume the execution of the program based on the cost per Megawatt. Since the procedure is based on the master-worker scheme, the performance of three different workload distributions is also analyzed to identify which one is more suitable according to the experimental conditions. The proposed approach outperforms the classification results obtained by previous works that use the same dataset. It achieves a speedup of 74.53 when running on a multi-node heterogeneous cluster, consuming only 13.38% of the energy consumed by the sequential version. Moreover, the results show that financial costs can be reduced when energy policy is activated and the importance of developing efficient methods, proving that energy-aware computing is necessary for sustainable computing.

Our Graph-Massivizer Project is thrilled to be part of the #DataWeek2023 event! Join us for a thought-provoking session on “Are current infrastructures suitable for extreme data processing? Technologies for data management.”

Don’t miss this opportunity to explore cutting-edge solutions and discuss the future of data processing together with Nuria De Lama Dumitru Roman Roberta Turra Radu Prodan Lilit Axner Jan Martinovič Bill Patrowicz Irena Pavlova! ?

? Tuesday 13th

⏰ 15:30 – 17:00

BDVA – Big Data Value Association

Radu Prodan presented the paper “Proactive SLA-aware Application Placement in the Computing Continuum” at the 37th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2023) <https://www.ipdps.org/> in St. Petersburg, Florida, USA.

Authors: Zahra Najafabadi Samani, Narges Mehran, Dragi Kimovski, and Radu Prodan, Alpen-Adria-Universität Klagenfurt

Abstract: The accelerating growth of modern distributed applications with low delivery deadlines leads to a paradigm shift towards the multi-tier computing continuum. However, the geographical dispersion, heterogeneity, and availability of the continuum resources may result in failures and quality of service degradation, significantly negating its advantages and lowering users’ satisfaction. We propose in this paper a proactive application placement PROS method relying on distributed coordination to prevent the quality of service violations through service-level agreements on the computing continuum. PROS employs a sigmoid function with adaptive weights for the different parameters to predict the service level agreement assurance of devices based on their past credentials and current capabilities. We evaluate PROS using two application workloads with different traffic stress levels up to 90 million services on a real testbed with 600 heterogeneous instances deployed over eight geographical locations. The results show that PROS increases the success rate by 7-33%, reduces the response time by 16-38%, and increases the deadline satisfaction rate by 19-42% compared to the two related work methods. A comprehensive simulation study with 1000 devices and a workload of up to 670 million services confirms the scalability of the results.