Exact Inference on Manycore Processors using Pointer Jumping

Exact inference is a key problem in exploring probabilistic graphical models. Most parallel algorithms for exact inference explore data and structural parallelism. These algorithms result in limited performance if the input model offers limited data and structural parallelism. In this paper, we study a pointer jumping based method on manycore systems for exact inference in junction trees. We adapt the technique for both evidence collection and evidence distribution so as to efficiently process junction trees with multiple evidence cliques. We also study the impact of junction tree topology on evidence collection. We implement the proposed method on state-of-the-art manycore systems. Experimental results show that, for junction trees with limited data and structural parallelism, pointer jumping is well suited to accelerate exact inference on manycore systems.

[1]  Viktor K. Prasanna,et al.  Collaborative scheduling of DAG structured computations on multicore processors , 2010, Conf. Computing Frontiers.

[2]  David Heckerman,et al.  Bayesian Networks for Data Mining , 2004, Data Mining and Knowledge Discovery.

[3]  Gregory F. Cooper,et al.  The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..

[4]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[5]  Zhaoyu Li,et al.  Parallelizing Probabilistic Inference: Some Early Explorations , 1992, UAI.

[6]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[7]  David M. Pennock Logarithmic Time Parallel Bayesian Inference , 1998, UAI.

[8]  Viktor K. Prasanna,et al.  Parallel Evidence Propagation on Multicore Processors , 2009, PaCT.

[9]  Viktor K. Prasanna,et al.  Node Level Primitives for Parallel Exact Inference , 2007 .

[10]  Ben Taskar,et al.  Rich probabilistic models for gene expression , 2001, ISMB.

[11]  Jaswinder Pal Singh,et al.  A parallel Lauritzen-Spiegelhalter algorithm for probabilistic inference , 1994, Proceedings of Supercomputing '94.

[12]  David A. Bader,et al.  A fast, parallel spanning tree algorithm for symmetric multiprocessors , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[13]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .