2012
DOI: 10.1186/1297-9686-44-29
|View full text |Cite
|
Sign up to set email alerts
|

Parallel Markov chain Monte Carlo - bridging the gap to high-performance Bayesian computation in animal breeding and genetics

Abstract: BackgroundMost Bayesian models for the analysis of complex traits are not analytically tractable and inferences are based on computationally intensive techniques. This is true of Bayesian models for genome-enabled selection, which uses whole-genome molecular data to predict the genetic merit of candidate animals for breeding purposes. In this regard, parallel computing can overcome the bottlenecks that can arise from series computing. Hence, a major goal of the present study is to bridge the gap to high-perfor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
20
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 18 publications
(21 citation statements)
references
References 30 publications
(41 reference statements)
1
20
0
Order By: Relevance
“…ALDsuite retains computation efficiency as the number and density of markers increases by analyzing PCs of small chromosomal regions. Additional computational efficiency can be achieved in multicore environments with support for the parallelization of ALDsuite using a distributed MCMC approach in which a separate analysis, or chain, is run for each parallel process [ 37 , 38 ]. In order to avoid unnecessary duplication of effort during the burn-in phase, each chain reports back to the main process after each iteration, where a remote proposal of each parameter is calculated based on the average of all parallel chains.…”
Section: Methodsmentioning
confidence: 99%
“…ALDsuite retains computation efficiency as the number and density of markers increases by analyzing PCs of small chromosomal regions. Additional computational efficiency can be achieved in multicore environments with support for the parallelization of ALDsuite using a distributed MCMC approach in which a separate analysis, or chain, is run for each parallel process [ 37 , 38 ]. In order to avoid unnecessary duplication of effort during the burn-in phase, each chain reports back to the main process after each iteration, where a remote proposal of each parameter is calculated based on the average of all parallel chains.…”
Section: Methodsmentioning
confidence: 99%
“…Ridge regression is also originated to handle the problem of inverting a nearly singular matrix and Cholesky decomposition is usually adopted to speed up the matrix inversion. Some high-performance Gibbs samplers and M-H sampling algorithms have been developed [71]. A straightforward solution is to run multiple chains simultaneously (see Gelman and Rubin [72]) on multiple virtual machines in computer clusters or using Cloud Computing platforms.…”
Section: Methodsmentioning
confidence: 99%
“…In the meantime, researchers continue to strive to improve computational efficiency of MCMC sampling schemes in animal breeding (Shariati and Sorensen 2008;Shariati et al 2009;Yang et al 2015). Animal breeding scientists have been particularly astute in developing computational enhancements for WGP models including parallel computing Wu et al 2012), Gauss Seidel residual updating (Legarra and Misztal 2008), or other right-hand-side updating strategies (Calus 2014). Although most code created for public domain use is written using efficient low-level programming languages such as FORTRAN, C or C++ Fernando 2009), often with convenient R wrapper packages (Endelman 2011;Pérez and de los Campos 2014;Wimmer et al 2012), the animal breeding community nevertheless has also been conscientious to provide lucid R code for pedagogical purposes as well (Gondro et al 2013) in an attempt to train and engage future researchers to further pursue these challenges.…”
Section: Improving Mcmc Schemesmentioning
confidence: 99%