loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05)
Automatic Data-Flow Graph Generation of MPI Programs
Rio de Janeiro, Brazil
October 24-October 27
ISBN: 0-7695-2446-X
ASCII Text
x 
 
Rafael Ennes Silva, Guilherme Pezzi, Nicolas Maillard, Tiaraju Diverio, "Automatic Data-Flow Graph Generation of MPI Programs," Computer Architecture and High Performance Computing, Symposium on, pp. 93-100, 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/CAHPC.2005.15,
author = {Rafael Ennes Silva and Guilherme Pezzi and Nicolas Maillard and Tiaraju Diverio},
title = {Automatic Data-Flow Graph Generation of MPI Programs},
journal ={Computer Architecture and High Performance Computing, Symposium on},
volume = {0},
year = {2005},
issn = {1550-6533},
pages = {93-100},
doi = {http://doi.ieeecomputersociety.org/10.1109/CAHPC.2005.15},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Architecture and High Performance Computing, Symposium on
TI - Automatic Data-Flow Graph Generation of MPI Programs
SN - 1550-6533
SP93
EP100
A1 - Rafael Ennes Silva,
A1 - Guilherme Pezzi,
A1 - Nicolas Maillard,
A1 - Tiaraju Diverio,
PY - 2005
KW - null
VL - 0
JA - Computer Architecture and High Performance Computing, Symposium on
ER -
 
Rafael Ennes Silva, UFRGS, Brazil
Guilherme Pezzi, UFRGS, Brazil
Nicolas Maillard, UFRGS, Brazil
Tiaraju Diverio, UFRGS, Brazil
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volume of exchanged data). In the case of MPI-based programs, the DFG may be built at run-time by overloading the data exchange primitives. This article presents a library that enables the generation of the DFG of a MPI program, and its use to analyze the network contention on a test-application: the Linpack benchmark. It is the first step towards automatic mapping of a MPI program on a distributed architecture.
Citation:
Rafael Ennes Silva, Guilherme Pezzi, Nicolas Maillard, Tiaraju Diverio, "Automatic Data-Flow Graph Generation of MPI Programs," sbac-pad, pp.93-100, 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.