Page 1 |
Save page Remove page | Previous | 1 of 190 | Next |
|
small (250x250 max)
medium (500x500 max)
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
Subset |
EXPLORATION OF PARALLELISM FOR
PROBABILISTIC GRAPHICAL MODELS
by
Yinglong Xia
A Dissertation Presented to the
FACULTY OF THE USC GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(COMPUTER SCIENCE)
December 2010
Copyright 2010 Yinglong Xia
Object Description
| Title | Exploration of parallelism for probabilistic graphical models |
| Author | Xia, Yinglong |
| Author email | yinglonx@usc.edu; yinglongxia@gmail.com |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Computer Science |
| School | Viterbi School of Engineering |
| Date submitted | 2010 |
| Restricted until | Unrestricted |
| Date published | 2010-09-28 |
| Advisor (committee chair) | Prasanna, Viktor K. |
| Advisor (committee member) |
Nakano, Aiichiro Dubois, Michel |
| Abstract | Probabilistic graphical models such as Bayesian networks and junction trees are widely used to compactly represent joint probability distributions. They have found applications in a number of domains, including medical diagnosis, credit assessment, genetics, among others. The computational complexity of exact inference, a key problem in exploring probabilistic graphical models, increases dramatically with the density of the network, the clique width and the number of states of random variables. In many cases, exact inference must be performed in real time.; In this work, we explore parallelism for exact inference at various granularities on state-of-the-art high performance computing platforms. We first study parallel techniques for converting an arbitrary Bayesian network into a junction tree. Then, at a fine grained level, we explore data parallelism in node level primitives for exact inference in junction trees. Based on the node level primitives, we develop computation kernels for evidence collection and distribution on both clusters and multicore processors. In addition, we propose a junction tree decomposition approach for exact inference on a cluster of processors to explore structural parallelism at a coarse grained level. To utilize structural parallelism dynamically, we also develop various schedulers for exact inference. Specifically, we develop a centralized scheduler for heterogeneous processors, a lock-free collaborative scheduler for multicore processors, and a hierarchical scheduler with dynamic thread grouping for manycore processors. The schedulers balance the workload across the cores and partition large tasks at runtime to adapt to the processor architecture. Finally, for junction trees offering limited parallelism at both data and structural levels, we propose a pointer jumping based method for exact inference to accelerate evidence propagation.; We implemented our proposed methods using Pthreads and Message Passing Interface (MPI) on various platforms, including clusters, general-purpose multicore processors, heterogeneous multicore processors, and manycore processors. Compared with various baseline algorithms using a representative set of junction trees, our proposed methods exhibit superior performance. |
| Keyword | parallel computing; parallel algorithm; probabilistic graphical model; exact inference; multicore processor; scheduler |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m3487 |
| Rights | Xia, Yinglong |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | http://www.usc.edu/isd/libraries/services/ask_a_librarian/email/ |
| Filename | etd-Xia-4046 |
| Archival file | uscthesesreloadpub_Volume14/etd-Xia-4046.pdf |
Description
| Title | Page 1 |
| Full text | EXPLORATION OF PARALLELISM FOR PROBABILISTIC GRAPHICAL MODELS by Yinglong Xia A Dissertation Presented to the FACULTY OF THE USC GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (COMPUTER SCIENCE) December 2010 Copyright 2010 Yinglong Xia |
Comments
Post a Comment for Page 1
