Share Email Print
cover

Proceedings Paper

Parallelization of Apriori algorithm using Charm++ library
Author(s): Marek Puścian; Waldemar Grabski
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

This paper deals with the problem of adapting sequential frequent item sets mining algorithm to parallel processing. The original Bodon's Apriori algorithm has been partitioned into loosely coupled tasks and prepared to be executed on several computation nodes using Charm++ library. Variety of optimization methods have been proposed and successfully implemented in parallel environment. The work provides enhancements to achieve good efficiency during parallelization of existing solutions, e.g.: how to organize communication between tasks. The presented approach has been illustrated with many experiments and measurements performed on parallelized algorithm.

Paper Details

Date Published: 11 September 2015
PDF: 8 pages
Proc. SPIE 9662, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2015, 96623S (11 September 2015); doi: 10.1117/12.2205908
Show Author Affiliations
Marek Puścian, Warsaw Univ. of Technology (Poland)
Waldemar Grabski, Warsaw Univ. of Technology (Poland)


Published in SPIE Proceedings Vol. 9662:
Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2015
Ryszard S. Romaniuk, Editor(s)

© SPIE. Terms of Use
Back to Top