News Help Institutional access
Back to results
Bibliographic record · Consultation and access
Document

Representing parallel programs with MPI by exploiting a graph-based approach

Sato, Liria Matsumoto et al · SEDICI UNLP · 2001

Supplementary material available
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.
Author / responsible party
Sato, Liria Matsumoto et al
Publisher
SEDICI UNLP
Year
2001
Language
English

Resource access

Open the content from the main option or choose another available source.

SEDICI UNLP SEDICI UNLP OAI-PMH
Entrar por SEDICI UNLP
Main access

Supplementary material available

El enlace apunta a material asociado, anexos, tablas, datos o página complementaria. No se marca como libro/texto completo.
Open material

Summary

Descripción general del contenido del recurso.

This paper presents a novel method for the analysis and representation of parallel program with MPI. Parallel programs are mapped onto graph-theoretical problems and are represented by DP*Tgraph, extension of T-graphs, timing graphs, which are similar to flow graphs. These graphs reflect the structure and the timing behavior of the code. The special merit of this new notation is that it uses a concise notation to characterize the static structure of a program and its possible execution paths. Eje: Programación concurrente Red de Universidades con Carreras en Informática (RedUNCI)

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Sato, L. M. E. A. (2001). Representing parallel programs with MPI by exploiting a graph-based approach. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/23303

MLA

Sato, Liria Matsumoto et al. Representing parallel programs with MPI by exploiting a graph-based approach. SEDICI UNLP, 2001. http://sedici.unlp.edu.ar/handle/10915/23303.

Chicago

Sato, Liria Matsumoto et al. 2001. Representing parallel programs with MPI by exploiting a graph-based approach. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/23303.

Harvard

Sato, L. M. E. A. 2001, Representing parallel programs with MPI by exploiting a graph-based approach, SEDICI UNLP, available at: http://sedici.unlp.edu.ar/handle/10915/23303 [Accessed 7 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
Representing parallel programs with MPI by exploiting a graph-based approach
Author / contributors
Sato, Liria Matsumoto et al
Publisher
SEDICI UNLP
Publication year
2001
Language
English

Subjects

Explore related resources through these subjects.

Ciencias Informáticas; Parallel programming; Distributed Systems; Concurrent Programming; graph theory applications; parallel program representation
Copied