Porting Decision Tree Algorithms to Multicore Using FastFlow
Abstract
The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine power, which can be only exploited via thread-level parallelism. Decision tree algorithms exhibit natural concurrency that makes them suitable to be parallelised. This paper presents an approach for easy-yet-efficient porting of an implementation of the C4.5 algorithm on multicores. The parallel porting requires minimal changes to the original sequential code, and it is able to exploit up to 7× speedup on an Intel dual-quad core machine.
Cite
Text
Aldinucci et al. "Porting Decision Tree Algorithms to Multicore Using FastFlow." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2010. doi:10.1007/978-3-642-15880-3_7Markdown
[Aldinucci et al. "Porting Decision Tree Algorithms to Multicore Using FastFlow." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2010.](https://mlanthology.org/ecmlpkdd/2010/aldinucci2010ecmlpkdd-porting/) doi:10.1007/978-3-642-15880-3_7BibTeX
@inproceedings{aldinucci2010ecmlpkdd-porting,
title = {{Porting Decision Tree Algorithms to Multicore Using FastFlow}},
author = {Aldinucci, Marco and Ruggieri, Salvatore and Torquati, Massimo},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2010},
pages = {7-23},
doi = {10.1007/978-3-642-15880-3_7},
url = {https://mlanthology.org/ecmlpkdd/2010/aldinucci2010ecmlpkdd-porting/}
}