Vincenzo Catania

Vincenzo Catania

Auto-generated profile, based on publicly available information

Vincenzo Catania

University of Catania

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
23 June 2024
Verified
Conference Paper
Open access
FBFrancesco Giulio Blanco
Francesco Giulio Blanco
EREnrico Russo
Enrico Russo
MPMaurizio Palesi
Maurizio Palesi
Davide PattiDavide Patti
Davide Patti
GAGiuseppe Ascia
Giuseppe Ascia
VCVincenzo Catania
Vincenzo Catania
Currently, there is a growing trend of outsourcing the execution of DNNs to cloud services. For service providers, managing multitenancy and ensuring high-quality service delivery, particularly in meeting stringent execution time constraints, assumes paramount importance, all while endeavoring to maintain cost-effectiveness. In this context, the utilization of heterogeneous multi-accelerator systems becomes increasingly relevant. This paper presents RELMAS, a low-overhead deep reinforcement learning algorithm designed for the online scheduling of DNNs in multi-tenant environments, taking into account the dataflow heterogeneity of accelerators and memory bandwidths contentions. By doing so, service providers can employ the most efficient scheduling policy for user requests, optimizing Service-Level-Agreement (SLA) satisfaction rates and enhancing hardware utilization. The application of RELMAS to a heterogeneous multi-accelerator system composed of various instances of Simba and Eyeriss sub-accelerators resulted in up to a 173% improvement in SLA satisfaction rate compared to state-of-the-art scheduling techniques across different workload scenarios, with less than a 1.5% energy overhead.

13 November 2002
Verified
Conference Paper
Closed access
GAG. Ascia
G. Ascia
VCV. Catania
V. Catania
GFG. Ficili
G. Ficili
Daniela Giovanna Anna PannoDaniela Giovanna Anna Panno
Daniela Giovanna Anna Panno


9 May 2023
Verified
Conference Paper
Open access
EREnrico Russo
Enrico Russo
MPMaurizio Palesi
Maurizio Palesi
GAGiuseppe Ascia
Giuseppe Ascia
Davide PattiDavide Patti
Davide Patti
Salvatore MonteleoneSalvatore Monteleone
Salvatore Monteleone
VCVincenzo Catania
Vincenzo Catania
Mapping a deep neural network (DNN) layer onto domain-specific accelerators can require an intractable number of choices regarding loop factorization, ordering, and spatial unrolling. Determining the optimal mapping that achieves the best figures in terms of latency and energy efficiency can be difficult due to the vast number of possible candidates that need to be exhaustively evaluated. Many techniques have been recently proposed for fast and efficient mapping space exploration; some of them adopt a black-box optimization approach, others make assumptions on the underlying accelerator memory hierarchy or require time-consuming model retraining. We propose an integer linear programming (ILP) approach and formulate a mathematical model, namely LEMON, that takes into account number of accesses to each buffer, energy costs and buffer bandwidths in the accelerator and is flexible enough to work with different memory hierarchies. Compared with state-of-the-art techniques, LEMON achieves up to 83% energy-delay product reduction when compared to another ILP-based approach (CoSA) and 27% when compared to a genetic algorithm approach (GAMMA).

4 April 2021 in Robotics
Verified
Journal Article
Open access
PDF file
Bruno AndoBruno Ando
Bruno Ando
LCLuciano Cantelli
Luciano Cantelli
VCVincenzo Catania
Vincenzo Catania
RCRuben Crispino
Ruben Crispino
Dario Calogero GuastellaDario Calogero Guastella
Dario Calogero Guastella
Giovanni MuscatoGiovanni Muscato
Giovanni Muscato
The Internet of Things paradigm envisions the interoperation among objects, people, and their surrounding environment. In the last decade, the spread of IoT-based solutions has been supported in various domains and scenarios by academia, industry, and standards-setting organizations. The wide variety of applications and the need for a higher level of autonomy and interaction with the environment have recently led to the rise of the Internet of Robotic Things (IoRT), where smart objects become autonomous robotic systems. As mentioned in the recent literature, many of the proposed solutions in the IoT field have to tackle similar challenges regarding the management of resources, interoperation among objects, and interaction with users and the environment. Given that, the concept of the IoT pattern has recently been introduced. In software engineering, a pattern is defined as a general solution that can be applied to a class of common problems. It is a template suggesting a solution for the same problem occurring in different contexts. Similarly, an IoT pattern provides a guide to design an IoT solution with the difference that the software is not the only element involved. Starting from this idea, we propose the novel concept of the IoRT pattern. To the authors’ knowledge, this is the first attempt at pattern authoring in the Internet of Robotic Things context. We focus on pattern identification by abstracting examples also in the Ambient Assisted Living (AAL) scenario. A case study providing an implementation of the proposed patterns in the AAL context is also presented and discussed.

9 January 2026 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
MPMaurizio Palesi
Maurizio Palesi
EREnrico Russo
Enrico Russo
GAGiuseppe Ascia
Giuseppe Ascia
HRHamaad Rafique
Hamaad Rafique
Davide PattiDavide Patti
Davide Patti
CACarmen Almudever
Carmen Almudever
The scalability of quantum computing is constrained by the physical and architectural limitations of monolithic quantum processors. Modular multi-core quantum architectures, which interconnect multiple quantum cores (QCs) via classical and quantum-coherent links, offer a promising alternative to address these challenges. However, transitioning to a modular architecture introduces communication overhead, where classical communication plays a crucial role in executing quantum algorithms by transmitting measurement outcomes and synchronizing operations across QCs. Understanding the impact of classical communication on execution time is therefore essential for optimizing system performance. In this work, we introduce qcomm , an open-source simulator designed to evaluate the role of classical communication in modular quantum computing architectures. qcomm provides a high-level execution and timing model that captures the interplay between quantum gate execution, entanglement distribution, teleportation protocols, and classical communication latency. We conduct an extensive experimental analysis to quantify the impact of classical communication bandwidth, interconnect types, and quantum circuit mapping strategies on overall execution time. Furthermore, we assess classical communication overhead when executing real quantum benchmarks mapped onto a cryogenically-controlled multi-core quantum system. Our results show that, while classical communication is generally not the dominant contributor to execution time, its impact becomes increasingly relevant in optimized scenarios—such as improved quantum technology, large-scale interconnects, or communication-aware circuit mappings. These findings provide useful insights for the design of scalable modular quantum architectures and highlight the importance of evaluating classical communication as a performance-limiting factor in future systems.