Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Reducing the run-time of MCMC programs by multithreading on SMP architectures

Tools
- Tools
+ Tools

Byrd, Jonathan M. R., Jarvis, Stephen A. and Bhalerao, Abhir (2008) Reducing the run-time of MCMC programs by multithreading on SMP architectures. In: 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2008), Miami, FL, APR 14-18, 2008. Published in: 2008 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-8 pp. 2242-2249.

Full text not available from this repository.

Abstract

The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov Chain Monte Carlo (MCMC) simulations are widely used for approximate counting problems, Bayesian inference and as a means for estimating very high-dimensional integrals. As such MCMC has found a wide variety of applications in fields including computational biology and physics, financial econometrics, machine learning and image processing. This paper presents a new method for reducing the run-time of Markov Chain Monte Carlo simulations by using SMP machines to speculatively perform iterations in parallel, reducing the runtime of MCMC programs whilst producing statistically identical results to conventional sequential implementations. We calculate the theoretical reduction in runtime that may be achieved using our technique under perfect conditions, and test and compare the method on a selection of multi-core and multi-processor architectures. Experiments are presented that show reductions in runtime of 35% using two cores and 55% using four cores.

Item Type: Conference Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Journal or Publication Title: 2008 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-8
Publisher: IEEE
ISBN: 978-1-4244-1693-6
Date: 2008
Number of Pages: 8
Page Range: pp. 2242-2249
Identification Number: 10.1109/IPDPS.2008.4536354
Publication Status: Published
Title of Event: 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2008)
Location of Event: Miami, FL
Date(s) of Event: APR 14-18, 2008
URI: http://wrap.warwick.ac.uk/id/eprint/29523

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us