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

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 structu...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Sato, Liria Matsumoto, Ching, Li Kuan
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2001
Materias:
Ciencias Informáticas
Parallel programming
Distributed Systems
Concurrent Programming
graph theory applications
parallel program representation
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23303
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
Descripción
Sumario: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.

Ejemplares similares