DocumentCode
2723669
Title
Framework for Mapping Data Mining Applications on GPUs
Author
Gainaru, Ana ; Slusanschi, Emil
Author_Institution
Nat. Center for Supercomput. Applic., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
fYear
2011
fDate
6-8 July 2011
Firstpage
71
Lastpage
78
Abstract
Data mining algorithms are expensive by nature, but when dealing with today´s dataset sizes, they are becoming even more slow and hard to use. Previous work has focused on parallelizing data mining algorithms on different architectures, and more recently, applications are starting to take advantage of the massive computation power and high bandwidth offered by GPUs. However there has been almost no prior work in offering a general methodology for parallelizing all types of data mining applications on hybrid architectures. This paper presents a framework for fast and efficient parallelization of data mining algorithms on GPU systems. The framework implements I/O transfer models that deal with the huge amount of data entries which are processed by this type of algorithms, all with numerous dependencies. Also the framework allows users to specify data requirements for each task so that the data scheduler can map efficiently each task on a GPU node and on a block in each of these processors improving the overall performance of the algorithm with around 20%.
Keywords
data mining; graphics processing units; GPU; I/O transfer models; data requirements; hybrid architectures; mapping data mining application framework; power computation; Algorithm design and analysis; Clustering algorithms; Computer architecture; Data mining; Graphics processing unit; Optimization; Random access memory; GPU; data mining applications; parallelization;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing (ISPDC), 2011 10th International Symposium on
Conference_Location
Cluj Napoca
Print_ISBN
978-1-4577-1536-5
Type
conf
DOI
10.1109/ISPDC.2011.20
Filename
6108227
Link To Document