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 dev
On Verification of Parallel Message-Passing Processes
β Scribed by Stein Krogdahl; Olav Lysne
- Book ID
- 105845171
- Publisher
- Springer
- Year
- 2002
- Tongue
- English
- Weight
- 205 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0934-5043
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Currently, message passing (MP) and shared address space (SAS) are the two leading parallel programming paradigms. MP has been standardized with MPI, and is the more common and mature approach; however, code development can be extremely difficult, especially for irregularly structured computations.
## Abstract This paper proposes a trace reduction method for assessing the improvability of the performance of message passing parallel programs. This assessment is based on a whatβif prediction approach that forecasts future program performance, for example, the execution time if the target progra