Parallelizing Probabilistic Inference: Some Early Explorations
Abstract
We report on an experimental investigation into opportunities for parallelism in beliefnet inference. Specifically, we report on a study performed of the available parallelism, on hypercube style machines, of a set of randomly generated belief nets, using factoring (SPI) style inference algorithms. Our results indicate that substantial speedup is available, but that it is available only through parallelization of individual conformal product operations, and depends critically on finding an appropriate factoring. We find negligible opportunity for parallelism at the topological, or clustering tree, level.
Cite
Text
D'Ambrosio et al. "Parallelizing Probabilistic Inference: Some Early Explorations." Conference on Uncertainty in Artificial Intelligence, 1992. doi:10.1016/B978-1-4832-8287-9.50013-XMarkdown
[D'Ambrosio et al. "Parallelizing Probabilistic Inference: Some Early Explorations." Conference on Uncertainty in Artificial Intelligence, 1992.](https://mlanthology.org/uai/1992/daposambrosio1992uai-parallelizing/) doi:10.1016/B978-1-4832-8287-9.50013-XBibTeX
@inproceedings{daposambrosio1992uai-parallelizing,
title = {{Parallelizing Probabilistic Inference: Some Early Explorations}},
author = {D'Ambrosio, Bruce and Fountain, Tony and Li, Zhaoyu},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {1992},
pages = {59-66},
doi = {10.1016/B978-1-4832-8287-9.50013-X},
url = {https://mlanthology.org/uai/1992/daposambrosio1992uai-parallelizing/}
}