Parallel implementation of DNAml program on message-passing architectures

被引：16

作者：

Ceron, C ^{[1
]}

Dopazo, J

Zapata, EL

Carazo, JM

Trelles, O

机构：

[1] Univ Malaga, Comp Architecture Dept, E-29071 Malaga, Spain

[2] TDI, I&D Dept, Madrid 28028, Spain

[3] CSIC, Ctr Nacl Biotecnol, Biocomp Unit, E-28049 Madrid, Spain

来源：

PARALLEL COMPUTING | 1998年 / 24卷 / 5-6期

关键词：

parallel computers; run-time analysis; phylogenetic trees; DNAml program;

D O I：

10.1016/S0167-8191(98)00002-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present a new computing approach for the parallelization on message-passing computer architectures of the DNAml algorithm, one of the most powerful tools available for constructing phylogenetic trees from DNA sequences. An analysis of the data dependencies of the method gave little chances to develop an efficient parallel approach. However, a careful run-time analysis of the behaviour of the algorithm allowed us to propose a very efficient parallel implementation based on the combination of advanced dynamic scheduling strategies, speculative running-time execution decisions and I/O buffering. In this work, we discuss specific Parallel Virtual Machine (PVM)-based implementations for a cluster of workstations and for Distributed Memory multiprocessors, with high performance results. The code can be obtained from our public-domain sites. (C) 1998 Published by Elsevier Science B.V. All rights reserved.

引用

页码：701 / 716

页数：16

共 50 条

[1] PARALLEL POLYGON RENDERING FOR MESSAGE-PASSING ARCHITECTURES
CROCKETT, TW
ORLOFF, T
IEEE PARALLEL & DISTRIBUTED TECHNOLOGY, 1994, 2 (02): : 17 - 28
[2] Benchmark evaluation of the message-passing overhead on modern parallel architectures
Bönisch, T
Resch, M
Berger, H
PARALLEL COMPUTING: FUNDAMENTALS, APPLICATIONS AND NEW DIRECTIONS, 1998, 12 : 411 - 418
[3] GROMACS: a message-passing parallel molecular dynamics implementation
Berendsen, H.J.C., 1600, Elsevier Science B.V., Amsterdam, Netherlands (91): : 1 - 3
[4] PERFORMANCE MODELS FOR MESSAGE-PASSING ARCHITECTURES
GUDVANGEN, S
HOLT, AGJ
IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1993, 140 (01): : 19 - 32
[5] GROMACS - A MESSAGE-PASSING PARALLEL MOLECULAR-DYNAMICS IMPLEMENTATION
BERENDSEN, HJC
VANDERSPOEL, D
VANDRUNEN, R
COMPUTER PHYSICS COMMUNICATIONS, 1995, 91 (1-3) : 43 - 56
[6] Optimality of Message-Passing Architectures for Sparse Graphs
Baranwal, Aseem
Fountoulakis, Kimon
Jagannath, Aukosh
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
[7] COMPUTATION ON PARALLEL MESSAGE-PASSING COMPUTERS
PETERSEN, J
PHYSICA SCRIPTA, 1991, T38 : 33 - 33
[8] Parallel universal message-passing and applications
Hey, A.J.G.
International Conference on Applications of Transputers, 1992, 26
[9] Algorithms for search trees on message-passing architectures
Colbrook, A
Brewer, EA
Dellarocas, CN
Weihl, WE
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (02) : 97 - 108
[10] OAL - AN IMPLEMENTATION OF AN ACTOR LANGUAGE ON A MASSIVELY PARALLEL MESSAGE-PASSING ARCHITECTURE
GLAVITTO, JL
GERMAIN, C
FOWLER, J
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 487 : 347 - 360

← 1 2 3 4 5 →