A new hybrid parallel algorithm for mrbayes

Authors:
Jianfu Zhou;Gang Wang;Xiaoguang Liu
Affiliations:
Nankai-Baidu Joint Laboratory, Nankai University, Tianjin, China;Nankai-Baidu Joint Laboratory, Nankai University, Tianjin, China;Nankai-Baidu Joint Laboratory, Nankai University, Tianjin, China
Venue:
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Year:
2010

Citing 5
Cited 1

Parallel Metropolis coupled Markov chain Monte Carlo for Bayesian phylogenetic inference

Bioinformatics
PBPI: a high performance implementation of Bayesian phylogenetic inference

Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Large-scale maximum likelihood-based phylogenetic analysis on the IBM BlueGene/L

Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Fine-grain Parallelism Using Multi-core, Cell/BE, and GPU Systems: Accelerating the Phylogenetic Likelihood Function

ICPP '09 Proceedings of the 2009 International Conference on Parallel Processing
Load Balance in the Phylogenetic Likelihood Kernel

ICPP '09 Proceedings of the 2009 International Conference on Parallel Processing

Resource-efficient utilization of CPU/GPU-based heterogeneous supercomputers for Bayesian phylogenetic inference

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

MrBayes, a popular program for Bayesian inference of phylogeny, has not been fast enough for Biologists when dealing with large real-world data sets This paper presents a new parallel algorithm that combines the chain-partitioned parallel algorithm with the chain-parallel algorithm to obtain higher concurrency We test the proposed hybrid algorithm with the two old algorithms on a heterogeneous cluster The results show that, the hybrid algorithm actually converts more CPU cores into higher speedup compared with the two control algorithms for all of four real-world DNA data sets, therefore is more practical.