Junction tree decomposition for parallel exact inference


We present a junction tree decomposition based algorithm for parallel exact inference. This is a novel parallel exact inference method for evidence propagation in an arbitrary junction tree. If multiple cliques contain evidence, the performance of any state-of-the-art parallel inference algorithm achieving logarithmic time performance is adversely affected. In this paper, we propose a new approach to overcome this problem. We decompose a junction tree into a set of chains. Cliques in each chain are partially updated after the evidence propagation. These partially updated cliques are then merged in parallel to obtain fully updated cliques. We derive the formula for merging partially updated cliques and estimate the computation workload of each step. Experiments conducted using MPI on state-of-the-art clusters showed that the proposed algorithm exhibits linear scalability and superior performance compared with other parallel inference methods.

DOI: 10.1109/IPDPS.2008.4536315

Extracted Key Phrases

8 Figures and Tables

Cite this paper

@article{Xia2008JunctionTD, title={Junction tree decomposition for parallel exact inference}, author={Yinglong Xia and Viktor K. Prasanna}, journal={2008 IEEE International Symposium on Parallel and Distributed Processing}, year={2008}, pages={1-12} }