Treffer: Porting decision tree algorithms to multicore using fastflow
Title:
Porting decision tree algorithms to multicore using fastflow
Authors:
Contributors:
José Luis Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag, Marco Aldinucci, Salvatore Ruggieri, Massimo Torquati
Publisher Information:
Springer-Verlag
DEU
Berlin Heidelberg
DEU
Berlin Heidelberg
Publication Year:
2010
Collection:
Università degli studi di Torino: AperTo (Archivio Istituzionale ad Accesso Aperto)
Subject Terms:
Document Type:
Konferenz
conference object
File Description:
STAMPA
Language:
English
Relation:
info:eu-repo/semantics/altIdentifier/isbn/364215879X; info:eu-repo/semantics/altIdentifier/isbn/9783642158797; info:eu-repo/semantics/altIdentifier/wos/WOS:000311562600007; ispartofbook:Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2010; European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2010; volume:6321; firstpage:7; lastpage:23; numberofpages:17; serie:LECTURE NOTES IN COMPUTER SCIENCE; alleditors:José Luis Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag; http://hdl.handle.net/2318/83743; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-78049350650; http://www.springerlink.com/content/x20020l947041770/
DOI:
10.1007/978-3-642-15880-3_7
Availability:
Rights:
info:eu-repo/semantics/closedAccess
Accession Number:
edsbas.75728F13
Database:
BASE
Weitere Informationen
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 7X speedup on an Intel dual-quad core machine.