@Article{ceron:dna,
  author = {C. Ceron and J. Dopazo and E. L. Zapata and J.M. Carazo and O.
  Trelles},
  title = {Parallel implementation of {DNAml} program on message-passing
  architectures},
  journal = {Parallel Computing},
  year = {1997},
  month = {June},
  volume = {24},
  number = {5--6},
  pages = {701--716},
  publisher = {Elsevier Science},
  URL = {http://dx.doi.org/10.1016/S0167-8191(98)00002-7},
  keywords = {parallel computers, run-time analysis, phylogenetic trees, DNAml
  program, source code, parallel I/O, pario-bib},
  abstract = {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.},
  comment = {They discuss the parallelization on message-passing computers of
  the {DNA}ml algorithm, a tool used to construct phylogenetic trees from {DNA}
  sequences. By performing a run-time analysis of the behavior of the algorithm
  they came up with an efficient parallel implementation based on dynamic
  scheduling strategies, speculative run-time execution decisions and I/O
  buffering. They use I/O buffering (prefetching) to fetch tasks that need to
  be processed. The parallel code was written in C using PVM for message
  passing and is avaialable via anonymous ftp at ftp.ac.uma.es.}
}