CGMGRAPH/CGMLIB: Implementing and testing CGM graph algorithms on PC clusters and shared memory machines
A Chan, F Dehne, R Taylor - The International Journal of …, 2005 - journals.sagepub.com
In this paper, we present CGMgraph, the first integrated library of parallel graph methods for
PC clusters based on Coarse Grained Multicomputer (CGM) algorithms. CGMgraph …
PC clusters based on Coarse Grained Multicomputer (CGM) algorithms. CGMgraph …
SWAP-Assembler: scalable and efficient genome assembly towards thousands of cores
Background There is a widening gap between the throughput of massive parallel
sequencing machines and the ability to analyze these sequencing data. Traditional …
sequencing machines and the ability to analyze these sequencing data. Traditional …
Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
In this paper we present deterministic parallel algorithms for the coarse-grained
multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following …
multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following …
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
E Cáceres, F Dehne, A Ferreira, P Flocchini… - … Colloquium on Automata …, 1997 - Springer
In this paper, we present deterministic parallel algorithms for the coarse grained
multicomputer (CGM) and bulk-synchronous parallel computer (BSP) models which solve …
multicomputer (CGM) and bulk-synchronous parallel computer (BSP) models which solve …
Parallel short sequence assembly of transcriptomes
BG Jackson, PS Schnable, S Aluru - BMC bioinformatics, 2009 - Springer
Background The de novo assembly of genomes and transcriptomes from short sequences is
a challenging problem. Because of the high coverage needed to assemble short sequences …
a challenging problem. Because of the high coverage needed to assemble short sequences …
Swap-assembler 2: Optimization of de novo genome assembler at extreme scale
In this paper, we analyze and optimize the most time-consuming steps of the SWAP-
Assembler, a parallel genome assembler, so that it can scale to a large number of cores for …
Assembler, a parallel genome assembler, so that it can scale to a large number of cores for …
[图书][B] Parallel methods for short read assembly
BG Jackson - 2009 - search.proquest.com
This work is on the parallel de novo assembly of genomic sequences from short sequence
reads. With short reads eliminating the reliability of read overlaps in predicting genomic co …
reads. With short reads eliminating the reliability of read overlaps in predicting genomic co …
CGMgraph/CGMlib: Implementing and Testing CGM Graph Algorithms on PC Clusters
A Chan, F Dehne - European Parallel Virtual Machine/Message Passing …, 2003 - Springer
In this paper, we present CGM graph, the first integrated library of parallel graph methods for
PC clusters based on CGM algorithms. CGM graph implements parallel methods for various …
PC clusters based on CGM algorithms. CGM graph implements parallel methods for various …
From parallel to external list ranking
J Sibeyn - 1997 - pure.mpg.de
Novel algorithms are presented for parallel and external memory list-ranking. The same
algorithms can be used for computing basic tree functions, such as the depth of a node. The …
algorithms can be used for computing basic tree functions, such as the depth of a node. The …
Evaluating the performance of MPI-2 dynamic communicators and one-sided communication
E Gabriel, GE Fagg, JJ Dongarra - … : 10th European PVM/MPI User's Group …, 2003 - Springer
This paper evaluates the performance of several MPI implementations regarding two
chapters of the MPI-2 specification. First, we analyze, whether the performance using …
chapters of the MPI-2 specification. First, we analyze, whether the performance using …