Permanent link to this recordhttp://hdl.handle.net/10754/671343
MetadataShow full item record
AbstractAlgorithms for frequent pattern mining, a popular informatics application, have unique requirements that are not met by any of the existing parallel tools. In particular, such applications operateon extremelylarge data sets and have irregular memory access patterns. For efficient parallelization of such applications, it is necessary to support dynamic load balancing along with scheduling mechanisms that allow users to exploit data locality. Given these requirements, task parallelism is the most promising of the available parallel programming models. However, existing solutions for task parallelism schedule tasks implicitly and hence, custom scheduling policies that can exploit data locality cannot be easily employed. In this paper we demonstrate and characterize the speedup obtained in a frequent pattern mining application using a custom clustered scheduling policy in place of the popular Cilk-style policy. We present PFunc, a novel task parallel library whose customizable task scheduling and task priorities facilitated the implementation of our clustered scheduling policy. © 2010 The authors and IOS Press. All rights reserved.
CitationKambadur Prabhanjan, Ghoting Amol, Gupta Anshul, & Lumsdaine Andrew. (2010). Extending Task Parallelism For Frequent Pattern Mining [JB]. Advances in Parallel Computing, 19(Parallel Computing: From Multicores and GPU’s to Petascale), 289–296. https://doi.org/10.3233/978-1-60750-530-3-289
SponsorsWe thank Melanie Dybvig for her help in improving the quality of this paper. Our work was supported by IBM, King Abdullah University of Science and Technology (KAUST), National Science Foundation grants EIA-0202048 and CCF-0541335, and a grant from the Lilly Endowment.
PublisherIOS Press BV