Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Leandro Fiorin

dblp:86/4319 · DBLP profile ↗
← Back
15ranked-venue papers
10as first author
1since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 14 · 9 first-author · 1 since 2021Software engineering, systems software and programming languages · 2 · 1 first-authorSecurity and privacy · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
4 papers
Memory systems · 68% Hardware accelerators and domain-specific architectures · 14% Distributed systems · 8%
Network and information security
1 paper
Hardware security and side channels · 77% Authentication and access control · 23%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 12 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems
processing-in-memory
0.622018
Near-Memory Acceleration for Radio Astronomy · IEEE Trans. Parallel Distributed Syst. 2018
An Architecture for Integrated Near-Data Processors · ACM Trans. Archit. Code Optim. 2017
Memory systems › processing-in-memory
near-memory processing
0.312018
Near-Memory Acceleration for Radio Astronomy · IEEE Trans. Parallel Distributed Syst. 2018
Hardware accelerators and domain-specific architectures
scientific computing accelerator
0.312018
Near-Memory Acceleration for Radio Astronomy · IEEE Trans. Parallel Distributed Syst. 2018
Memory systems
cache coherence
0.312017
An Architecture for Integrated Near-Data Processors · ACM Trans. Archit. Code Optim. 2017
Memory systems › processing-in-memory
near-data processing
0.312017
An Architecture for Integrated Near-Data Processors · ACM Trans. Archit. Code Optim. 2017
Distributed systems
fault tolerance
0.212014
Fault-Tolerant Network Interfaces for Networks-on-Chip · IEEE Trans. Dependable Secur. Comput. 2014
Computational science and engineering › astronomy
radio astronomy
0.112018
Near-Memory Acceleration for Radio Astronomy · IEEE Trans. Parallel Distributed Syst. 2018
Memory systems › memory management
virtual memory
0.112017
An Architecture for Integrated Near-Data Processors · ACM Trans. Archit. Code Optim. 2017
Interconnection networks and networks-on-chip
network interface
0.112008
Secure Memory Accesses on Networks-on-Chip · IEEE Trans. Computers 2008
Electronic design automation › hardware verification and test
fault modeling
0.112014
Fault-Tolerant Network Interfaces for Networks-on-Chip · IEEE Trans. Dependable Secur. Comput. 2014
Electronic design automation › hardware verification and test › fault modeling
functional fault model
0.112014
Fault-Tolerant Network Interfaces for Networks-on-Chip · IEEE Trans. Dependable Secur. Comput. 2014
Hardware reliability and fault tolerance › redundancy › modular redundancy
triple modular redundancy
0.112014
Fault-Tolerant Network Interfaces for Networks-on-Chip · IEEE Trans. Dependable Secur. Comput. 2014

Methods — techniques the papers use, named apart from their topics

3d-stacked memory · 0.7energy-efficiency optimization · 0.3energy efficiency optimization · 0.3system simulation · 0.3fault injection simulation · 0.2firewall-based access control · 0.2authentication · 0.2
YearPublicationVenuePosition
2024 MEPAD: A Memory-Efficient Parallelized Direct Convolution Algorithm for Deep Neural Networks
Leandro Fiorin, Cristina Silvano
Euro-Par (2)1
2018 Near-Memory Acceleration for Radio Astronomy
abstract
Processing-in-memory and near-memory computing have recently been rediscovered as a way to alleviate the “memory wall problem” of traditional computing architectures. In this paper, we discuss the implementation of a 3D-stacked near-memory accelerator, targeting radio astronomy and scientific applications. After exploring the design space of the architecture by focusing on minimizing the execution power of the processing pipeline of the SKA1-Low central signal processor, we show that our accelerator can achieve an energy efficiency of up to 390 GFLOPS/W, corresponding to an energy consumption one order of magnitude lower than alternative state-of-the-art implementations. When running additional mathematical and streaming-oriented kernels, our accelerator achieves from 6.4x to 20x energy efficiency improvement compared to alternative solutions.
Leandro Fiorin, Rik Jongerius, Erik Vermij, Jan van Lunteren, Christoph Hagleitner
IEEE Trans. Parallel Distributed Syst.1
2017 MeSAP: A fast analytic power model for DRAM memories
abstract
The design of an energy-efficient memory subsystem is one of the key issues that system architects face today. To achieve this goal, architects usually rely on system simulators and trace-based DRAM power models. However, their long execution time makes the approach infeasible for the design-space exploration of next-generation exascale computing systems. Analytic models, in contrast, are orders of magnitude faster. In this paper, we propose a new analytic memory-scheduler-agnostic power model for DRAM, henceforth referred to as MeSAP. Similarly to state-of-the-art trace-based approaches, our analytic model achieves an average error of 20%, while being an order of magnitude faster. Furthermore, we integrate MeSAP into an analytic performance model of general-purpose processors and show its applicability to the design of a computing system targeting scientific image processing applications.
Sandeep Poddar, Rik Jongerius, Leandro Fiorin, Giovanni Mariani, Gero Dittmann, Andreea Anghel, Henk Corporaal
DATE3
2017 Boosting the Efficiency of HPCG and Graph500 with Near-Data Processing
abstract
HPCG and Graph500 can be regarded as the two most relevant benchmarks for high-performance computing systems. Existing supercomputer designs, however, tend to focus on floating-point peak performance, a metric less relevant for these two benchmarks, leaving resources underutilized, and resulting in little performance improvements, for these benchmarks, over time. In this work, we analyze the implementation of both benchmarks on a novel shared-memory near-data processing architecture. We study a number of aspects: 1. a system parameter design exploration, 2. software optimizations, and 3. the exploitation of unique architectural features like user-enhanced coherence as well as the exploitation of data-locality for inter near-data processor traffic.For the HPCG benchmark, we show a factor 2.5x application level speedup with respect to a CPU, and a factor 2.5x power-efficiency improvement with respect to a GPU. For the Graph500 benchmark, we show up to a factor 3.5x speedup with respect to a CPU. Furthermore, we show that, with many of the existing data-locality optimizations for this specific graph workload applied, local memory bandwidth is not the crucial parameter, and a high-bandwidth as well as low-latency interconnect are arguably more important, shining a new light on the near-data processing characteristics most relevant for this type of heavily optimized graph processing.
Erik Vermij, Leandro Fiorin, Christoph Hagleitner, Koen Bertels
ICPP2
2017 An Architecture for Integrated Near-Data Processors
abstract
To increase the performance of data-intensive applications, we present an extension to a CPU architecture that enables arbitrary near-data processing capabilities close to the main memory. This is realized by introducing a component attached to the CPU system-bus and a component at the memory side. Together they support hardware-managed coherence and virtual memory support to integrate the near-data processors in a shared-memory environment. We present an implementation of the components, as well as a system-simulator, providing detailed performance estimations. With a variety of synthetic workloads we demonstrate the performance of the memory accesses, the mixed fine- and coarse-grained coherence mechanisms, and the near-data processor communication mechanism. Furthermore, we quantify the inevitable start-up penalty regarding coherence and data writeback, and argue that near-data processing workloads should access data several times to offset this penalty. A case study based on the Graph500 benchmark confirms the small overhead for the proposed coherence mechanisms and shows the ability to outperform a real CPU by a factor of two.
Erik Vermij, Leandro Fiorin, Rik Jongerius, Christoph Hagleitner, Jan van Lunteren, Koen Bertels
ACM Trans. Archit. Code Optim.2
2014 Fault-Tolerant Network Interfaces for Networks-on-Chip
abstract
As the complexity of designs increases and technology scales down into the deep-submicron domain, the probability of malfunctions and failures in the networks-on-chip (NoCs) components increases. In this work, we focus on the study and evaluation of techniques for increasing reliability and resilience of network interfaces (NIs) within NoC-based multiprocessor system-on-chip architectures. NIs act as interfaces between intellectual property cores and the communication infrastructure; the faulty behavior of one of them could affect, therefore, the overall system. In this work, we propose a functional fault model for the NI components by evaluating their susceptibility to faults. We present a two-level fault-tolerant solution that can be employed for mitigating the effects of both permanent and temporary faults in the NI. Experimental simulations show that with a limited overhead, we can obtain an NI reliability comparable to the one obtainable by implementing the system by using standard triple modular redundancy techniques, while saving up to 48 percent in area, as well as obtaining a significant energy reduction.
Leandro Fiorin, Mariagiovanna Sami
IEEE Trans. Dependable Secur. Comput.1
2014 A Configurable Monitoring Infrastructure for NoC-Based Architectures
abstract
In this brief, we propose a monitoring architecture for networks-on-chip that provides system information useful for designers to efficiently exploit, at design time and run-time, the system resources available in multiprocessor system-on-chip platforms. We focus on the analysis of the architectural details and design challenges of such a system, by describing powerful tools for monitoring information that can be used both at run-time for detecting dynamic changes in system behavior and at post-execution time for debugging and profiling of applications. This brief describes the design of the monitoring probes, together with the events detectable by them, and discusses an architecture for collecting, storing, and analyzing the information gathered during an application execution.
Leandro Fiorin, Gianluca Palermo, Cristina Silvano
IEEE Trans. Very Large Scale Integr. Syst.1
2012 Security Enhanced Linux on embedded systems: A hardware-accelerated implementation
abstract
Security Enhanced Linux implements fine-grained mandatory access control. Despite its usefulness, the overhead of implementing it on embedded devices is prohibitive. Therefore, in the past it has been proposed to accelerate SELinux by means of dedicated hardware; in this work we demonstrate the feasibility of such an approach by implementing a hardware accelerator for SELinux on a FPGA-based platform. Our implementation obtains a huge reduction in the performance overhead and energy consumption of SELinux, yet employing a limited chip area.
Leandro Fiorin, Alberto Ferrante, Konstantinos Padarnitsas, Francesco Regazzoni 0001
ASP-DAC1
2012 System Adaptivity and Fault-Tolerance in NoC-based MPSoCs: The MADNESS Project Approach
abstract
Modern embedded systems increasingly require adaptive run-time management. The system may adapt the mapping of the applications in order to accommodate the current workload conditions, to balance load for efficient resource utilization, to meet quality of service agreements, to avoid thermal hot-spots and to reduce power consumption. As the possibility of experiencing run-time faults becomes increasingly relevant with deep-sub-micron technology nodes, in the scope of the MADNESS project, we focus particularly on the problem of graceful degradation by dynamic remapping in presence of run-time faults. In this paper, we summarize the major results achieved in the MADNESS project until now regarding the system adaptivity and fault tolerant processing. We report the first results of the integration between platform level and middleware level support for adaptivity and fault tolerance. A case study demonstrates the survival ability of the system via a low-overhead process migration mechanism and a near-optimal online remapping heuristic.
Paolo Meloni, Giuseppe Tuveri, Luigi Raffo, Emanuele Cannella, Todor P. Stefanov, Onur Derin, Leandro Fiorin, Mariagiovanna Sami
DSD7
2011 Design of Fault Tolerant Network Interfaces for NoCs
abstract
Networks-on-Chip (NoCs) appeared as a strategy to deal with the communication requirements of complex IP-based System-on-Chips. As the complexity of designs increases and the technology scales down into the deep-submicron domain, the probability of malfunctions and failures in the NoC components increases. This paper focuses on the study and evaluation of techniques for increasing reliability and resilience of Network Interfaces (NIs). NIs act as interfaces between IP cores and the communication infrastructure, a faulty behavior in them could affect therefore the overall system. In this work, we propose a functional fault model for the NI components, and we present a two-level fault tolerant solution that can be employed for mitigating the effects of both single-event upset soft errors and hard errors on the NI. Experiments show that with a limited overhead we can obtain a significant reliability of the NI, while saving up to 83% in area with respect to a standard Triple Modular Redundancy implementation, as well as a significant energy reduction.
Leandro Fiorin, Laura Micconi, Mariagiovanna Sami
DSD1
2011 Online task remapping strategies for fault-tolerant Network-on-Chip multiprocessors
abstract
As CMOS technology scales down into the deep-submicron domain, the aspects of fault tolerance in complex Networks-on-Chip (NoCs) architectures are assuming an increasing relevance. Task remapping is a software based solution for dealing with permanent failures in processing elements in the NoC. In this work, we formulate the optimal task mapping problem for mesh-based NoC multiprocessors with deterministic routing as an integer linear programming (ILP) problem with the objective of minimizing the communication traffic in the system and the total execution time of the application. We find the optimal mappings at design time for all scenarios where single-faults occur in the processing nodes. We propose heuristics for the online task remapping problem and compare their performance with the optimal solutions.
Onur Derin, Deniz Kabakci, Leandro Fiorin
NOCS3
2009 MPSoCs run-time monitoring through Networks-on-Chip
abstract
Networks-on-Chip (NoCs) have appeared as design strategy to overcome the limitations, in terms of scalability, efficiency, and power consumption of current buses. In this paper, we discuss the idea of using NoCs to monitor system behaviour at run-time by tracing activities at initiators and targets. Main goal of the monitoring system is to retrieve information useful for run-time optimization and resources allocation in adaptive systems. Information detected by probes embedded within NIs is sent to a central unit, in charge of collecting and elaborating the data. We detail the design of the basic blocks and analyse the overhead associated with the ASIC implementation of the monitoring system, as well as discussing implications in terms of the additional traffic generated in the NoC.
Leandro Fiorin, Gianluca Palermo, Cristina Silvano
DATE1
2008 Implementation of a reconfigurable data protection module for NoC-based MPSoCs
abstract
Security issues are emerging to be a basic concern in modern SoC development. Since in the field of on-chip interconnections the security problem continues to remain mostly an unexplored topic, this paper proposes a novel technique for data protection that uses the communication subsystem as basis. The proposed architecture works as a firewall managing the memory accesses on the basis of a lookup table containing the access rights. This module, called Data Protection Unit (DPU), has been designed for MPSoC architectures and integrated in the Network Interfaces near the shared memory. We implement the DPU inside an MPSoC architecture on FPGA and we add features to the module to be aware of dynamic reconfiguration of the system software. Starting from a general overview of our design down to components’ structure, we introduce the place and the role of the DPU module inside the system for a reconfigurable secure implementation of a MPSoC on FPGA. The description of the DPU concept, its implementation, and integration into the system are described in detail. Finally, the architecture is fully implemented on FPGA and tested on a Xilinx Virtex-II Pro board.
Leandro Fiorin, Slobodan Lukovic, Gianluca Palermo
IPDPS1
2008 Secure Memory Accesses on Networks-on-Chip
abstract
Security is gaining increasing relevance in the development of embedded devices. Towards a secure system at each level of design, this paper addresses security aspects related to Network-on-Chip (NoC) architectures, foreseen as the communication infrastructure of next-generation embedded devices. In the context of NoC-based multiprocessor systems, we focus on the topic, not yet thoroughly faced, of data protection. In this paper, we present a secure NoC architecture composed of a set of Data Protection Units (DPUs) implemented within the Network Interfaces (NIs)\footnote{Part of this work is under patent pending}. The run-time configuration of the programmable part of the DPUs is managed by a central unit, the Network Security Manager (NSM). The DPU, similar to a firewall, can check and limit the access rights (none, read, write, or both) of processors accessing data and instructions in a shared memory - in particular distinguishing between the operating roles (supervisor/user and secure/unsecure) of the processing elements. We explore different alternative implementations for the DPU and demonstrate how this unit does not affect the network latency if the memory request has the appropriate rights. We also focus on the dynamic updating of the DPUs to support their utilization in dynamic environments, and on the utilization of authentication techniques to increase the level of security.
Leandro Fiorin, Gianluca Palermo, Slobodan Lukovic, Valerio Catalano, Cristina Silvano
IEEE Trans. Computers1
2007 Security Aspects in Networks-on-Chips: Overview and Proposals for Secure Implementations
abstract
Security has gained increasing relevance in the development of embedded devices. Towards the aim of a secure system at each level of the design, in this paper we address security aspects related to networks-on-chips (NoCs) architectures. After presenting the attacks most likely to address NoCs, we survey existing academic and industrial secure architectures relevant to our case, focusing in particular on their communication infrastructure. We outline and propose possible solutions to contrast some of the attacks described and suggest the use of the NoC as a mean to monitor and detect unexpected system behaviors.
Leandro Fiorin, Cristina Silvano, Mariagiovanna Sami
DSD1