loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'06)
Scalable Parallel Implementation of Exact Inference in Bayesian Networks
Minneapolis, Minnesota
July 12-July 15
ISBN: 0-7695-2612-8
Vasanth Krishna Namasivayam, University of Southern California, Los Angeles, USA
Viktor K. Prasanna, University of Southern California, Los Angeles, USA
We present a scalable parallel implementation for exact inference in Bayesian Networks. We explore two levels of parallelization: top level parallelization which uses pointer jumping to stride across nodes; and node level parallelization which parallelizes the node.

We have implemented the algorithm using MPI and OpenMP. We consider three different types of input junction trees: linear junction trees, balanced trees and random junction trees, and obtained speedups of 203, 181 and 190 respectively over 256 processors.

Index Terms:
Bayesian Networks, Junction Tree, Partitioning, Scalability, Pointer-Jumping, Loop level parallelization.
Citation:
Vasanth Krishna Namasivayam, Viktor K. Prasanna, "Scalable Parallel Implementation of Exact Inference in Bayesian Networks," icpads, vol. 1, pp.143-150, 12th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.