Proceedings of the Great Lakes Symposium on VLSI 2017 2017
DOI: 10.1145/3060403.3060416
|View full text |Cite
|
Sign up to set email alerts
|

Random Forest Architectures on FPGA for Multiple Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(8 citation statements)
references
References 11 publications
0
7
0
1
Order By: Relevance
“…Thanks to their inherent concurrent memory accesses and computational parallelism FPGAs are a good platform for performance boost of random forests. In [60] authors demonstrate the trade-o↵s between area utilization and context switch time between di↵erent architectures, and show how each architecture maps well to a di↵erent design scenario. The paper [61] compares and contrasts the e↵ectiveness of FPGAs, GP-GPUs, and multicore CPUs for accelerating classification using models generated by compact random forest machine learning classifiers and shows that FPGAs provide the highest performance solution, but require a multi-chip / multi-board system to execute even modest sized forests, while GP-GPUs o↵er a more flexible solution with reasonably high performance that scales with forest size.…”
Section: Related Workmentioning
confidence: 99%
“…Thanks to their inherent concurrent memory accesses and computational parallelism FPGAs are a good platform for performance boost of random forests. In [60] authors demonstrate the trade-o↵s between area utilization and context switch time between di↵erent architectures, and show how each architecture maps well to a di↵erent design scenario. The paper [61] compares and contrasts the e↵ectiveness of FPGAs, GP-GPUs, and multicore CPUs for accelerating classification using models generated by compact random forest machine learning classifiers and shows that FPGAs provide the highest performance solution, but require a multi-chip / multi-board system to execute even modest sized forests, while GP-GPUs o↵er a more flexible solution with reasonably high performance that scales with forest size.…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, the highly parallel architecture of FPGAs is exploited to accelerate the design even further. In a different implementation domain, authors in [16] suggested two possible architectures for a random forest implementation on hardware, memory-centric and comparator-centric. The memory-centric approach enables a quick context switching from one random forest model to another through simply loading new node information into the tree level memory.…”
Section: Hardware Implementationmentioning
confidence: 99%
“…Keeping in mind the use of two datasets, this entails the need to incorporate the context switching feature of the memory-centric architecture. Therefore, in this paper, and with noticeable modifications to the implementation suggested in [16], the proposed implementation will follow the memory-centric approach.…”
Section: Hardware Implementationmentioning
confidence: 99%
“…In Ref. [17] three different architectures are proposed for a random forest classifier on a ZYNQ evaluation board, and in Ref.…”
Section: Related Workmentioning
confidence: 99%