By Topic

Task Parallel Implementation of Belief Propagation in Factor Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nam Ma ; Comput. Sci. Dept., Univ. of Southern California, Los Angeles, CA, USA ; Yinglong Xia ; Prasanna, V.K.

Factor graphs have been increasingly used as probabilistic graphical models. Belief propagation is a prominent algorithm for inference in factor graphs. Due to the high complexity of inference, parallel techniques for belief propagation are needed. In this paper, we explore task parallelism for belief propagation in an acyclic factor graph. Our approach consists of building a task dependency graph based on the input factor graph and then using a dynamic task scheduler to exploit task parallelism. We conducted experiments on a state-of-the-art multi-core system using a variety of acyclic factor graphs. The experimental results show the efficiency and scalability of the proposed approach with a 37x speedup on a 40-core system.

Published in:

Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2012 IEEE 26th International

Date of Conference:

21-25 May 2012