Stefano Galantino

Stefano Galantino

Auto-generated profile, based on publicly available information

Stefano Galantino

Department of Computer and Control Engineering, Politecnico di Torino Torino, Italy

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 May 2023 in Computer
Verified
Journal Article
Closed access
SGStefano Galantino
Stefano Galantino
FRFulvio Risso
Fulvio Risso
VCVlad Coroama
Vlad Coroama
AMAntonio Manzalini
Antonio Manzalini
This article evaluates the benefits of the distribution of a fluid workload across heterogeneous devices focusing on the power consumption of the computing continuum and proposes a suitable methodology to transform current desktop applications into proof-of-concept fluid software.

18 March 2024 in IEEE Open Journal of the Communications Society
Verified
Journal Article
Open access
GCGabriele Castellano
Gabriele Castellano
SGStefano Galantino
Stefano Galantino
FRFulvio Risso
Fulvio Risso
Antonio ManzaliniAntonio Manzalini
Antonio Manzalini
has also resulted in increased complexity for Cloud orchestration tools. Traditional tools were designed for centralized data centers and are ineffective for locating microservices in geographically-distributed edge-like infrastructures. This paper presents Phare, a decentralized scheduling algorithm designed to optimize the placement of microservices by satisfying their computing and communication demands while minimizing deployment costs. Phare employs a heuristic-based approach to solve the NP-Hard scheduling problem, prioritizing the microservices with the more stringent requirements and placing them on the most convenient computing facilities, based on the concept of affinity, contributing to the field by providing a more holistic approach to resource scheduling in edge computing. We validate our approach against Firmament, the state-of-the-art workload scheduling algorithm for component-based applications, on simulated edge infrastructures with hundreds of clusters. Phare achieves up to a 10× reduction in terms of deployment costs compared to Firmament while providing a much lower scheduling latency.

14 December 2025
Verified
Conference Paper
Open access
SGStefano Galantino
Stefano Galantino
RMRiccardo Medina
Riccardo Medina
AOAttilio Oliva
Attilio Oliva
FRFulvio Risso
Fulvio Risso
GFGiovanni Frattini
Giovanni Frattini

20 February 2026 in Computer
Verified
Journal Article
Closed access
SGStefano Galantino
Stefano Galantino
JMJacopo Marino
Jacopo Marino
FRFulvio Risso
Fulvio Risso
SBStefano Braghin
Stefano Braghin
LNLiubov Nedoshivina
Liubov Nedoshivina
DSDomenico Siracusa
Domenico Siracusa
Despite the number of projects and initiatives aiming at creating the so-called computing continuum, surprisingly no commonly adopted definitions exist so far. This article proposes a definition of the computing continuum that relies on three transparency properties, namely orchestration, communication, and resource availability.

14 December 2025
Verified
Conference Paper
Open access
EDElisa Drudi
Elisa Drudi
Giuseppe Di ModicaGiuseppe Di Modica
Giuseppe Di Modica
Luca FoschiniLuca Foschini
Luca Foschini
SGStefano Galantino
Stefano Galantino
FRFulvio Risso
Fulvio Risso
MTMauro Tortonesi
Mauro Tortonesi

22 April 2024
Verified
Conference Paper
Open access
SGStefano Galantino
Stefano Galantino
APAndrea Pinto
Andrea Pinto
FEFlavio Esposito
Flavio Esposito
Antonio ManzaliniAntonio Manzalini
Antonio Manzalini
FRFulvio Risso
Fulvio Risso
In the rapidly evolving landscape of distributed computing, maintaining energy efficiency in edge and data center infrastructures has become critical. While the problem has been faced with centralized approaches assuming knowledge of the available underlying infrastructure resources, this paper introduces a distributed task allocation framework emphasizing energy awareness without requiring infrastructure knowledge. The framework is designed to optimize energy consumption in heterogeneous computing environments, leveraging a distributed consensus algorithm that allows nodes to maximize individual or global goals. Each private custom utility function enables a node to carefully determine whether executing a task is efficient, thus ensuring flexibility in the task allocation process based on local preferences. While showcasing the energy efficiency of our framework, we also illustrate that it is not necessary to disclose the underlying infrastructure resources status, ensuring the preservation of potentially sensitive local resources information. Experimental results demonstrate the framework's ability to achieve optimal power consumption outcomes while maintaining privacy, offering a significant advancement over traditional centralized allocation policies and Kubernetes-like scheduling algorithms.