Interactive data mining on a CBEA cluster

Authors:
Sabine McConnell;David Patton;Richard Hurley;Wilfred Blight;Graeme Young
Affiliations:
Department of Computing and Information Systems, Trent University, Peterborough, ON, Canada;Department of Physics and Astronomy, Trent University, Peterborough, ON, Canada;Department of Computing and Information Systems, Trent University, Peterborough, ON, Canada;Department of Computing and Information Systems, Trent University, Peterborough, ON, Canada;Department of Computing and Information Systems, Trent University, Peterborough, ON, Canada
Venue:
HPCS'09 Proceedings of the 23rd international conference on High Performance Computing Systems and Applications
Year:
2009

Citing 12
Cited 0

Trading MIPS and memory for knowledge engineering

Communications of the ACM
ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Shared Memory Parallelization of Data Mining Algorithms: Techniques, Programming Interface, and Performance

IEEE Transactions on Knowledge and Data Engineering
The potential of the cell processor for scientific computing

Proceedings of the 3rd conference on Computing frontiers
Vectorized data processing on the cell broadband engine

DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware
A Performance Study of Secure Data Mining on the Cell Processor

CCGRID '08 Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
Data mining on the cell broadband engine

Proceedings of the 22nd annual international conference on Supercomputing
Data Mining Algorithms on the Cell Broadband Engine

Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Optimizing matrix multiplication for a short-vector SIMD architecture - CELL processor

Parallel Computing
Paper: Nearest neighbor classification on two types of SIMD machines

Parallel Computing
A parallel implementation of the k nearest neighbours classifier in three levels: threads, MPI processes and the grid

VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Parallel nearest neighbour algorithms for text categorization

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present implementations of two data-mining algorithms on a CELL processor, and on a low-cost CBEA (CELL Broadband Engine Architecture) cluster using multiple PlayStation3 consoles. Typical batch-processing environments are often unsuitable for interactive data-mining processes that require repeated adjustments to parameters, pre-processing steps, and data, while contemporary desktops do not offer sufficient resources for the large datasets available today. Our implementations for the k Nearest Neighbour algorithm and the Decision Tree scale linearly with the number of samples in the training data and the number of processors, and demonstrate runtimes of under a minute for up to 500 000 samples.