Abstract & Keywords |
The whole computer hardware industry embraced multi-core. The extreme optimisation of sequential algorithms is then 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 in-depth study of the parallelisation of an implementation of the C4.5 algorithm for multi-core architectures. We characterise elapsed time lower bounds for the forms of parallelisations adopted, and achieve close to optimal performances. Our implementation is based on the FastFlow parallel programming environment and it requires minimal changes to the original sequential code.
Keywords: fastflow
|
@article{yadtff:ccpe:13,
volume = {26},
number = {3},
author = {Marco Aldinucci and Salvatore Ruggieri and Massimo Torquati},
keywords = {fastflow},
url = {http://calvados.di.unipi.it/storage/paper_files/2013_yadtff_ccpe.pdf},
abstract = {The whole computer hardware industry embraced multi-core. The
extreme optimisation of sequential algorithms is then 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 in-depth study of the
parallelisation of an implementation of the C4.5 algorithm for
multi-core architectures. We characterise elapsed time lower
bounds for the forms of parallelisations adopted, and achieve
close to optimal performances. Our implementation is based on the
FastFlow parallel programming environment and it requires minimal
changes to the original sequential code.},
title = {Decision Tree Building on Multi-Core using FastFlow},
journal = {Concurrency and Computation: Practice and Experience},
pages = {800-820},
year = {2014},
}
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)