𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Timing parallel programs that use message passing

✍ Scribed by Nicholas T. Karonis

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
766 KB
Volume
14
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

High-level abstractions for message-pass
High-level abstractions for message-passing parallel programming
✍ Fan Chan; Jiannong Cao; Yudong Sun πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 684 KB

Large-scale scientific and engineering computation problems are usually complex and consequently the development of parallel programs for solving these problems is a difficult task. In this paper, we describe the graph-oriented programming (GOP) model and environment for building and evaluating para

Trace reduction for performance improvem
Trace reduction for performance improvement assessment of message passing parallel programs
✍ Fumihiko Ino; Yuki Kanbe; Masao Okita; Kenichi Hagihara πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 794 KB

## 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

Parallel implementation of DNAml program
Parallel implementation of DNAml program on message-passing architectures
✍ C Ceron; J Dopazo; E.L Zapata; J.M Carazo; O Trelles πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 361 KB

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