SSE/EFI Working Paper Series in Economics and Finance,
Stockholm School of Economics

Abstract: Prefetching is a simple and general method for single-chain parallelisation of the Metropolis-Hastings algorithm based on the idea of evaluating the posterior in parallel and ahead of time. In this paper improved Metropolis-Hastings prefetching algorithms are presented and evaluated. It is shown how to use available information to make better predictions of the future states of the chain and increase the efficiency of prefetching considerably. The optimal acceptance rate for the prefetching random walk Metropolis-Hastings algorithm is obtained for a special case and it is shown to decrease in the number of processors employed. The performance of the algorithms is illustrated using a well-known macroeconomic model. Bayesian estimation of DSGE models, linearly or nonlinearly approximated, is identified as a potential area of application for prefetching methods. The generality of the proposed method, however, suggests that it could be applied in many other contexts as well.

Keywords: Prefetching; Metropolis-Hastings; Parallel Computing; DSGE models; Optimal acceptance rate

JEL-codes: C11; C13; C63

39 pages, First version: December 2, 2008. Revised: December 2, 2009.

Full text files

hastef0706.pdf  Full text

Download statistics

Published as

Ingvar Strid, (2010), 'Efficient parallelisation of Metropolis-Hastings algorithms using a prefetching approach', Computational Statistics and Data Analysis, vol 54, no 11, pages 2814-2835

• Stockholm School of Economics
• Home page for this series

Questions (including download problems) about the papers in this series should be directed to Helena Lundin ()
Report other problems with accessing this service to Sune Karlsson ().

RePEc:hhs:hastef:0706This page generated on 2024-09-13 22:15:07.