Fabio Checconi
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
Fabio Checconi has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Jesmin Jahan Tithi
Intel (United States), Santa Clara, USA
2 shared publications - Daniele Buono
IBM Research, Yorktown Heights, USA
1 shared publication Dario Faggioli
ReTiS Lab, Pisa, Italy
1 shared publication- Douglas Doerfler
Lawrence Berkeley National Laboratory
1 shared publication Fabrizio Petrini
Intel Corporation, Santa Clara, CA, USA
1 shared publication- Fabrizio Petrini
Intel Labs 95054 Santa Clara CA USA
1 shared publication
Latest Publications
- 20 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Micro
- Vol. 43 (5) , 78-87
The Intel Programmable and Integrated Unified Memory Architecture Graph Analytics Processor
High performance large scale graph analytics are essential to timely analyze relationships in big data sets. Conventional processor architectures suffer from inefficient resource usage and bad scaling on those workloads. To enable efficient and scalable graph analysis, Intel ® developed the Programmable Integrated Unified Memory Architecture (PIUMA) as a part of the DARPA Hierarchical Identify Verify Exploit (HIVE) program. PIUMA consists of many multi-threaded cores, fine-grained memory and network accesses, a globally shared address space, powerful offload engines and a tightly integrated optical interconnection network. This paper presents the PIUMA architecture, and documents our experience in designing and building a prototype chip and its bring-up process. PIUMA silicon has successfully powered on demonstrating key aspects of the architecture, some of which will be incorporated into future Intel products.
- 20 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Micro
- Vol. 43 (5) , 78-87
The Intel Programmable and Integrated Unified Memory Architecture Graph Analytics Processor
High performance large scale graph analytics are essential to timely analyze relationships in big data sets. Conventional processor architectures suffer from inefficient resource usage and bad scaling on those workloads. To enable efficient and scalable graph analysis, Intel ® developed the Programmable Integrated Unified Memory Architecture (PIUMA) as a part of the DARPA Hierarchical Identify Verify Exploit (HIVE) program. PIUMA consists of many multi-threaded cores, fine-grained memory and network accesses, a globally shared address space, powerful offload engines and a tightly integrated optical interconnection network. This paper presents the PIUMA architecture, and documents our experience in designing and building a prototype chip and its bring-up process. PIUMA silicon has successfully powered on demonstrating key aspects of the architecture, some of which will be incorporated into future Intel products.
- Open Access
- 15 November 2015
- Published by Association for Computing Machinery (ACM)
- Vol. 20, 1-10
Exploring network optimizations for large-scale graph analytics
Graph analytics are arguably one of the most demanding workloads for high-performance systems and interconnection networks. Graph applications often display all-to-all, fine-grained, high-rate communication patterns that expose the limits of the network protocol stacks. Load and communication imbalance generate hard-to-predict network hot-spots, and may require computational steering due to unpredictable data distributions. In this paper we present a lightweight communication library, implemented \"on the metal\" of BlueGene/Q and POWER7 IH that we have used to support large-scale graph algorithms up to 96K processing nodes and 6 million threads. With this library we have explored several optimization techniques, including overlapped communication, non-blocking collectives, message aggregation, and computation in the network for special collective communication patterns, such as parallel prefix. The experimental results show significant performance improvements, ranging from 5X to 10X, when compared to equally optimized MPI implementations.
- 15 November 2015
- Published by Association for Computing Machinery (ACM)
- Vol. 20, 1-10
Open AccessExploring network optimizations for large-scale graph analytics
Graph analytics are arguably one of the most demanding workloads for high-performance systems and interconnection networks. Graph applications often display all-to-all, fine-grained, high-rate communication patterns that expose the limits of the network protocol stacks. Load and communication imbalance generate hard-to-predict network hot-spots, and may require computational steering due to unpredictable data distributions. In this paper we present a lightweight communication library, implemented \"on the metal\" of BlueGene/Q and POWER7 IH that we have used to support large-scale graph algorithms up to 96K processing nodes and 6 million threads. With this library we have explored several optimization techniques, including overlapped communication, non-blocking collectives, message aggregation, and computation in the network for special collective communication patterns, such as parallel prefix. The experimental results show significant performance improvements, ranging from 5X to 10X, when compared to equally optimized MPI implementations.
- Open Access
- 22 March 2010
- Published by Association for Computing Machinery (ACM)
- p. 340-345
Sporadic Server revisited
The Sporadic Server (SS) overcomes the major limitations of other Resource Reservation Fixed Priority based techniques, but it also presents some drawbacks, mainly related to an increased scheduling overhead and a not so efficient behavior during overrun situations. In this paper we introduce and prove the effectiveness of an improved SS with reduced overhead and fairer handling of server overrun situations. We also show how this can be efficiently exploited to provide temporal isolation in a multiprocessor platform, adapting already existing schedulability tests.
- 22 March 2010
- Published by Association for Computing Machinery (ACM)
- p. 340-345
Open AccessSporadic Server revisited
The Sporadic Server (SS) overcomes the major limitations of other Resource Reservation Fixed Priority based techniques, but it also presents some drawbacks, mainly related to an increased scheduling overhead and a not so efficient behavior during overrun situations. In this paper we introduce and prove the effectiveness of an improved SS with reduced overhead and fairer handling of server overrun situations. We also show how this can be efficiently exploited to provide temporal isolation in a multiprocessor platform, adapting already existing schedulability tests.