Exploiting task-based parallelism in Bayesian Uncertainty Quantification

8Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

We introduce a task-parallel framework for non-intrusive Bayesian Uncertainty Quantification and Propagation of complex and computationally demanding physical models on massively parallel computing architectures. The framework incorporates Laplace asymptotic approximations and stochastic algorithms along with distributed numerical differentiation. Sampling is based on the Transitional Markov Chain Monte Carlo algorithm and its variants while the optimization tasks associated with the asymptotic approximations are treated via the Covariance Matrix Adaptation Evolution Strategy. Exploitation of task-based parallelism is based on a platform-agnostic adaptive load balancing library that orchestrates scheduling of multiple physical model evaluations on computing platforms that range from multicore systems to hybrid GPU clusters. Experimental results using representative applications demonstrate the flexibility and excellent scalability of the proposed framework.

Cite

CITATION STYLE

APA

Hadjidoukas, P. E., Angelikopoulos, P., Kulakova, L., Papadimitriou, C., & Koumoutsakos, P. (2015). Exploiting task-based parallelism in Bayesian Uncertainty Quantification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9233, pp. 532–544). Springer Verlag. https://doi.org/10.1007/978-3-662-48096-0_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free