Patrizio Dazzi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Patrizio Dazzi has a total of 165 co-authors. Here are the top co-authors by number of shared publications:
- Matteo Mordacchini
IIT-CNR Pisa Italy
28 shared publications Emanuele Carlini
Institute of Information Science and Technologies, National Research Council (CNR)
19 shared publications- Emanuele Carlini
National Research Council
18 shared publications - Laura Ricci
University of Pisa
18 shared publications Massimo Coppola
Institute of Information Science and Technologies “A. Faedo”, National Research Council of Italy, Pisa, Italy
11 shared publications- Marco Danelutto
Department of Computer Science, University of Pisa, Pisa, Italy
10 shared publications
Latest Publications
- 16 November 2026
- Published by Springer Nature
- p. 254-262
RESCUE-IT: A Dual-Mode Agentic AI Framework for Resource-Efficient Emergency Response over the Cloud-Edge Continuum
- 16 November 2026
- Published by Springer Nature
- p. 254-262
RESCUE-IT: A Dual-Mode Agentic AI Framework for Resource-Efficient Emergency Response over the Cloud-Edge Continuum
- 10 July 2026
- Published by Springer Nature
- p. 131-143
Usable Agent Discovery for Decentralized AI Systems
- 10 July 2026
- Published by Springer Nature
- p. 131-143
Usable Agent Discovery for Decentralized AI Systems
- 2 July 2026
- Published by Springer Nature
- p. 518-528
WebAssembly and Unikernels: A Comparative Study for Serverless at the Edge
- 2 July 2026
- Published by Springer Nature
- p. 518-528
WebAssembly and Unikernels: A Comparative Study for Serverless at the Edge
- Open Access
- 23 June 2026
- Published by Springer Nature in International Journal of Networked and Distributed Computing
- Vol. 14 (1) , 19
From the Internet of AI Agents to the Society of Agents: A Manifesto for Governed Networked Intelligence
The Internet of AI Agents has been proposed as a natural evolution of the Internet of Things and the Artificial Intelligence of Things: a decentralized ecosystem in which autonomous agents interact, cooperate, and learn collectively. Yet, connectivity alone is not sufficient to support large-scale populations of agents acting on behalf of humans, organizations, machines, and other agents. As agentic systems grow in size, autonomy, and operational relevance, the central challenge shifts from enabling communication to governing collective behavior. This editorial argues that the next frontier of networked and distributed intelligence is the emergence of a Society of Agents : a structured population of autonomous AI agents whose interactions are shaped by shared protocols, roles, norms, memory, trust mechanisms, accountability structures, and governance processes. The analogy with human societies is not intended anthropomorphically, but structurally: human societies scale intelligence through language, institutions, collective memory, roles, incentives, and causal accountability; agent societies will require computational counterparts of these mechanisms. We identify shared societal memory and causal governance as two foundational capabilities for this transition. Shared memory enables cumulative collaboration beyond ephemeral message exchange, while causal governance makes distributed agentic operations traceable, auditable, and accountable. We formulate this transition as a scientific manifesto: the next generation of networked intelligence should be designed not merely as collections of increasingly autonomous agents, but as governed computational societies grounded in shared memory, causal accountability, institutional mechanisms, and human oversight. We outline architectural layers, research challenges, and emerging examples of multi-agent orchestration for governable collective agency.
- 23 June 2026
- Published by Springer Nature in International Journal of Networked and Distributed Computing
- Vol. 14 (1) , 19
Open AccessFrom the Internet of AI Agents to the Society of Agents: A Manifesto for Governed Networked Intelligence
The Internet of AI Agents has been proposed as a natural evolution of the Internet of Things and the Artificial Intelligence of Things: a decentralized ecosystem in which autonomous agents interact, cooperate, and learn collectively. Yet, connectivity alone is not sufficient to support large-scale populations of agents acting on behalf of humans, organizations, machines, and other agents. As agentic systems grow in size, autonomy, and operational relevance, the central challenge shifts from enabling communication to governing collective behavior. This editorial argues that the next frontier of networked and distributed intelligence is the emergence of a Society of Agents : a structured population of autonomous AI agents whose interactions are shaped by shared protocols, roles, norms, memory, trust mechanisms, accountability structures, and governance processes. The analogy with human societies is not intended anthropomorphically, but structurally: human societies scale intelligence through language, institutions, collective memory, roles, incentives, and causal accountability; agent societies will require computational counterparts of these mechanisms. We identify shared societal memory and causal governance as two foundational capabilities for this transition. Shared memory enables cumulative collaboration beyond ephemeral message exchange, while causal governance makes distributed agentic operations traceable, auditable, and accountable. We formulate this transition as a scientific manifesto: the next generation of networked intelligence should be designed not merely as collections of increasingly autonomous agents, but as governed computational societies grounded in shared memory, causal accountability, institutional mechanisms, and human oversight. We outline architectural layers, research challenges, and emerging examples of multi-agent orchestration for governable collective agency.
- 31 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (3) , 2232-2245
LEMON: LLM-Enabled Monitoring for Microservices Orchestration
The complexity of modern microservice architectures has surpassed the capabilities of traditional orchestration tools, which rely on static, manual workflows. This limits scalability and adaptability, especially to dynamic workloads. This paper argues for a paradigm shift towards self-managing, intent-driven microservices orchestration systems, where human operators express high-level goals in natural language. As a foundational step towards this vision of autonomous orchestration agents, we introduce LEMON: a new architecture that leverages Large Language Models (LLMs) for intelligent microservice monitoring. We also propose a comprehensive classification to structure this emerging field. Our evaluation demonstrates that fine-tuning Small Language Models (SLMs) for intent classification significantly enhances accuracy while ensuring the model's output is reliably structured for automation. Furthermore, our analysis of the trade-offs between model size, precision, and latency provides a practical guide for deploying these systems. We foresee this monitoring capability as the critical ”sense” component toward autonomous microservices orchestration loops. By diagnosing performance bottlenecks from natural language queries, LEMON enables future systems to automatically suggest and execute solutions. This work lays the groundwork for truly self-managing, intent-driven systems.
- 31 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (3) , 2232-2245
LEMON: LLM-Enabled Monitoring for Microservices Orchestration
The complexity of modern microservice architectures has surpassed the capabilities of traditional orchestration tools, which rely on static, manual workflows. This limits scalability and adaptability, especially to dynamic workloads. This paper argues for a paradigm shift towards self-managing, intent-driven microservices orchestration systems, where human operators express high-level goals in natural language. As a foundational step towards this vision of autonomous orchestration agents, we introduce LEMON: a new architecture that leverages Large Language Models (LLMs) for intelligent microservice monitoring. We also propose a comprehensive classification to structure this emerging field. Our evaluation demonstrates that fine-tuning Small Language Models (SLMs) for intent classification significantly enhances accuracy while ensuring the model's output is reliably structured for automation. Furthermore, our analysis of the trade-offs between model size, precision, and latency provides a practical guide for deploying these systems. We foresee this monitoring capability as the critical ”sense” component toward autonomous microservices orchestration loops. By diagnosing performance bottlenecks from natural language queries, LEMON enables future systems to automatically suggest and execute solutions. This work lays the groundwork for truly self-managing, intent-driven systems.
- 29 March 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 182
Declarative traffic engineering for Low-Latency and reliable networking
- 29 March 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 182
Declarative traffic engineering for Low-Latency and reliable networking
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 120403-120420
Intelligent Self-Optimization for Edge and IoT Storage Platforms
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 120403-120420
Open AccessIntelligent Self-Optimization for Edge and IoT Storage Platforms
- Open Access
A Parallel and Distributed Rust Library for Core Decomposition on Large Graphs
In this paper, we investigate the parallelization of $k$-core decomposition, a method used in graph analysis to identify cohesive substructures and assess node centrality. Although efficient sequential algorithms exist for this task, the scale of modern networks requires faster, multicore-ready approaches. To this end, we adapt a distributed $k$-core algorithm originally proposed by Montresor et al. to shared-memory systems and implement it in Rust, leveraging the language's strengths in concurrency and memory safety. We developed three progressively optimized versions: SequentialK as a baseline, ParallelK introducing multi-threaded message passing, and FastK further reducing synchronization overhead. Extensive experiments on real-world datasets, including road networks, web graphs, and social networks, show that FastK consistently outperforms both SequentialK and ParallelK, as well as a reference Python implementation available in the NetworkX library. Results indicate up to an 11x speedup on 16 threads and execution times up to two orders of magnitude faster than the Python implementation.
Open AccessA Parallel and Distributed Rust Library for Core Decomposition on Large Graphs
In this paper, we investigate the parallelization of $k$-core decomposition, a method used in graph analysis to identify cohesive substructures and assess node centrality. Although efficient sequential algorithms exist for this task, the scale of modern networks requires faster, multicore-ready approaches. To this end, we adapt a distributed $k$-core algorithm originally proposed by Montresor et al. to shared-memory systems and implement it in Rust, leveraging the language's strengths in concurrency and memory safety. We developed three progressively optimized versions: SequentialK as a baseline, ParallelK introducing multi-threaded message passing, and FastK further reducing synchronization overhead. Extensive experiments on real-world datasets, including road networks, web graphs, and social networks, show that FastK consistently outperforms both SequentialK and ParallelK, as well as a reference Python implementation available in the NetworkX library. Results indicate up to an 11x speedup on 16 threads and execution times up to two orders of magnitude faster than the Python implementation.
- Open Access
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 195611-195656
High-Performance Serverless Computing: A Systematic Literature Review on Serverless for HPC, AI, and Big Data
The widespread deployment of large-scale, compute-intensive applications such as high-performance computing, artificial intelligence, and big data is leading to convergence between cloud and high-performance computing infrastructures. Cloud providers are increasingly integrating high-performance computing capabilities in their infrastructures, such as hardware accelerators and high-speed interconnects, while researchers in the high-performance computing community are starting to explore cloud-native paradigms to improve scalability, elasticity, and resource utilization. In this context, serverless computing emerges as a promising execution model to efficiently handle highly dynamic, parallel, and distributed workloads. This paper presents a comprehensive systematic literature review of 122 research articles published between 2018 and early 2025, exploring the use of the serverless paradigm to develop, deploy, and orchestrate compute-intensive applications across cloud, high-performance computing, and hybrid environments. From these, a taxonomy comprising eight primary research directions and nine targeted use case domains is proposed, alongside an analysis of recent publication trends and collaboration networks among authors, highlighting the growing interest and interconnections within this emerging research field. Overall, this work aims to offer a valuable foundation for both new researchers and experienced practitioners, guiding the development of next-generation serverless solutions for parallel compute-intensive applications.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 195611-195656
Open AccessHigh-Performance Serverless Computing: A Systematic Literature Review on Serverless for HPC, AI, and Big Data
The widespread deployment of large-scale, compute-intensive applications such as high-performance computing, artificial intelligence, and big data is leading to convergence between cloud and high-performance computing infrastructures. Cloud providers are increasingly integrating high-performance computing capabilities in their infrastructures, such as hardware accelerators and high-speed interconnects, while researchers in the high-performance computing community are starting to explore cloud-native paradigms to improve scalability, elasticity, and resource utilization. In this context, serverless computing emerges as a promising execution model to efficiently handle highly dynamic, parallel, and distributed workloads. This paper presents a comprehensive systematic literature review of 122 research articles published between 2018 and early 2025, exploring the use of the serverless paradigm to develop, deploy, and orchestrate compute-intensive applications across cloud, high-performance computing, and hybrid environments. From these, a taxonomy comprising eight primary research directions and nine targeted use case domains is proposed, alongside an analysis of recent publication trends and collaboration networks among authors, highlighting the growing interest and interconnections within this emerging research field. Overall, this work aims to offer a valuable foundation for both new researchers and experienced practitioners, guiding the development of next-generation serverless solutions for parallel compute-intensive applications.
- 2 November 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 176
Combining declarative and linear programming for application management in the cloud-edge continuum
- 2 November 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 176
Combining declarative and linear programming for application management in the cloud-edge continuum