✦ LIBER ✦

High-level abstractions for message-passing parallel programming

✍ Scribed by Fan Chan; Jiannong Cao; Yudong Sun

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 684 KB
Volume: 29
Category: Article
ISSN: 0167-8191
DOI: 10.1016/j.parco.2003.05.008

No coin nor oath required. For personal study only.

✦ Synopsis

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 parallel applications. The GOP model provides higher level abstractions for message-passing parallel programming and the software environment offers tools which can ease programmers for parallelizing, writing, and deploying scientific and engineering computing applications. We discuss the motivations and various issues in developing the model and the software environment, present the design of the system architecture and the components, and describe the evaluation of the environment implemented on top of MPI with a sample parallel scientific application program. With the support of the high-level abstractions provided by the proposed GOP environment, programming of parallel applications on various parallel architectures can be greatly simplified.

📜 SIMILAR VOLUMES

Structural testing criteria for message-

Structural testing criteria for message-passing parallel programs

✍ S. R. S. Souza; S. R. Vergilio; P. S. L. Souza; A. S. Simão; A. C. Hausen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 637 KB

Timing parallel programs that use messag

Timing parallel programs that use message passing

✍ Nicholas T. Karonis 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 766 KB

Special Issue: Message passing interface

Special Issue: Message passing interface-based parallel programming with Java

✍ Baker, Mark 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 29 KB

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

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

Performance modeling for SPMD message-pa

Performance modeling for SPMD message-passing programs

✍ BREHM, JÜRGEN; WORLEY, PATRICK H.; MADHUKAR, MANISH 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 279 KB 👁 2 views

Today's massively parallel machines are typically message-passing systems consisting of hundreds or thousands of processors. Implementing parallel applications efficiently in this environment is a challenging task, and poor parallel design decisions can be expensive to correct. Tools and techniques