Random Forests (RFs) are simple, interpretable, and parallelizable Machine Learning (ML) models, well-suited for deployment on edge devices such as Field-Programmable Gate Arrays (FPGAs). Existing hardware accelerators often exploit both horizontal and vertical parallelism of RFs to improve performance, at the cost of increasing hardware complexity. We propose Hokidachi, a novel RF accelerator architecture that relies solely on horizontal parallelism, reducing memory fragmentation and enhancing compatibility with a wider range of models, while also enabling between 2× and 4× lower inference latencies.
Hokidachi: Low-Latency Random Forest Inference on FPGAs through full Horizontal Parallelism
Verosimile, Alessandro;Santambrogio, Marco D.
2026-01-01
Abstract
Random Forests (RFs) are simple, interpretable, and parallelizable Machine Learning (ML) models, well-suited for deployment on edge devices such as Field-Programmable Gate Arrays (FPGAs). Existing hardware accelerators often exploit both horizontal and vertical parallelism of RFs to improve performance, at the cost of increasing hardware complexity. We propose Hokidachi, a novel RF accelerator architecture that relies solely on horizontal parallelism, reducing memory fragmentation and enhancing compatibility with a wider range of models, while also enabling between 2× and 4× lower inference latencies.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2026074563.pdf
Accesso riservato
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
125.63 kB
Formato
Adobe PDF
|
125.63 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.



