This article presents algorithms for temporal parallelization of Bayesian smoothers. We define the elements and operators to pose these problems as solutions all-prefix-sums operations which efficient parallel scan-algorithms are available. present general filtering smoothing equations, specialize them linear/Gaussian models. The advantage proposed is that they reduce linear complexity standard...

ii

Parallel Computing solves computationally large problems by partitioning into multiple tasks and running simultaneously on multicore or multiprocessor environment based on shared or distributed memory architectures. New multicore era demands software programmer to develop parallel programs to completely utilize the hardware parallelism. Writing parallel program manually for complex problem is a...

In the quest for additional computational power to provide higher software performance, industry have shifted to multi-core processing units. At the same time, many existing applications still contain sequential software; in these cases, multi-core processors would not deeply improve performances and in general would be under-utilized since software running on top of them are not conceived to e...