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

Enrico Tabanelli

dblp:271/7181 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2023
0000-0002-3155-8774ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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
1 paper
Embedded and real-time systems · 67% Hardware accelerators and domain-specific architectures · 33%
Artificial intelligence
1 paper
Efficient and distributed learning · 50% Kernel, tree and ensemble methods · 50%

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

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.612022
Optimizing Random Forest-Based Inference on RISC-V MCUs at the Extreme Edge · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Embedded and real-time systems › embedded processor
microcontroller
0.612022
Optimizing Random Forest-Based Inference on RISC-V MCUs at the Extreme Edge · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Embedded and real-time systems › embedded machine learning
TinyML
0.612022
Optimizing Random Forest-Based Inference on RISC-V MCUs at the Extreme Edge · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Machine learning › Kernel, tree and ensemble methods › decision tree learning
decision tree optimization
0.212022
Optimizing Random Forest-Based Inference on RISC-V MCUs at the Extreme Edge · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Machine learning › Efficient and distributed learning
model compression
0.212022
Optimizing Random Forest-Based Inference on RISC-V MCUs at the Extreme Edge · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022

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

random forest · 1.1kernel optimization · 1.1decision tree · 1.1
YearPublicationVenuePosition
2023 DNN Is Not All You Need: Parallelizing Non-neural ML Algorithms on Ultra-low-power IoT Processors
abstract
Machine Learning (ML) functions are becoming ubiquitous in latency- and privacy-sensitive IoT applications, prompting a shift toward near-sensor processing at the extreme edge and the consequent increasing adoption of Parallel Ultra-low-power (PULP) IoT processors. These compute- and memory-constrained parallel architectures need to run efficiently a wide range of algorithms, including key Non-neural ML kernels that compete favorably with Deep Neural Networks in terms of accuracy under severe resource constraints. In this article, we focus on enabling efficient parallel execution of Non-neural ML algorithms on two RISCV-based PULP platforms, namely, GAP8, a commercial chip, and PULP-OPEN, a research platform running on an FPGA emulator. We optimized the parallel algorithms through a fine-grained analysis and intensive optimization to maximize the speedup, considering two alternative Floating-point (FP) emulation libraries on GAP8 and the native FPU support on PULP-OPEN. Experimental results show that a target-optimized emulation library can lead to an average 1.61× runtime improvement and 37% energy reduction compared to a standard emulation library, while the native FPU support reaches up to 32.09× and 99%, respectively. In terms of parallel speedup, our design improves the sequential execution by 7.04× on average on the targeted octa-core platforms leading to energy and latency decrease up to 87%. Last, we present a comparison with the ARM Cortex-M4 microcontroller, a widely adopted commercial solution for edge deployments, which is 12.87× slower than PULP-OPEN.
Enrico Tabanelli, Giuseppe Tagliavini, Luca Benini
ACM Trans. Embed. Comput. Syst.1
2022 Optimizing Random Forest-Based Inference on RISC-V MCUs at the Extreme Edge
abstract
Random forests (RFs) use a collection of decision trees (DTs) to perform the classification or regression. RFs are adopted in a wide variety of machine learning (ML) applications, and they are finding increasing use also in scenarios at the extreme edge of the Internet of Things (TinyML) where memory constraints are particularly tight. This article addresses the optimization of the computational and storage costs for running DTs on the microcontroller units (MCUs) typically deployed in TinyML scenarios. We introduce three alternative DT kernels optimized for memory- and compute-limited MCUs, providing insight into the key memory-latency tradeoffs on an open-source RISC-V platform. We identify key bottlenecks and demonstrate that SW optimizations enable up to significant memory footprint and latency decrease. Experimental results show that the optimized kernels achieve up to 4.5$\mu \text{s}$latency,$4.8\times $speedup, and 45% storage reduction against the widely-adopted naive DT design. We carry out a detailed performance and energy cost analysis of various optimized DT variants: the best approach requires just 8 instructions and 0.155 pJ per decision.
Enrico Tabanelli, Giuseppe Tagliavini, Luca Benini
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2022 Trimming Feature Extraction and Inference for MCU-Based Edge NILM: A Systematic Approach
abstract
Nonintrusive load monitoring (NILM) enables the disaggregation of the global power consumption of multiple loads, taken from a single smart electrical meter, into appliance-level details. State-of-the-art approaches are based on machine learning methods and exploit the fusion of time- and frequency-domain features from current and voltage sensors. Unfortunately, these methods are compute-demanding and memory-intensive. Therefore, running low-latency NILM on low-cost resource-constrained microcontroller unit (MCU)-based meters is currently an open challenge. This article addresses the optimization of the feature spaces as well as the computational and storage cost reduction needed for executing state-of-the-art (SoA) NILM algorithms on memory- and compute-limited MCUs. We compare four supervised learning techniques on different classification scenarios and characterize the overall NILM pipeline's implementation on an MCU-basedSmart Measurement Node. Experimental results demonstrate that optimizing the feature space enables edge MCU-based NILM with 95.15% accuracy, resulting in a small drop compared to the most accurate feature vector deployment (96.19%) while achieving up to 5.45× speedup and 80.56% storage reduction. Furthermore, we show that low-latency NILM relying only on current measurements reaches almost 80% accuracy, allowing a major cost reduction by removing voltage sensors from the hardware (HW) design.
Enrico Tabanelli, Davide Brunelli, Andrea Acquaviva, Luca Benini
IEEE Trans. Ind. Informatics1