Sciweavers

90 search results - page 11 / 18
» Data-Flow Analysis for MPI Programs
Sort
View
129
Voted
DAGSTUHL
1996
15 years 28 days ago
Specialization of Imperative Programs Through Analysis of Relational Expressions
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
Alexander Sakharov
CLUSTER
2003
IEEE
15 years 4 months ago
Implications of a PIM Architectural Model for MPI
Memory may be the only system component that is more commoditized than a microprocessor. To simultaneously exploit this and address the impending memory wall, processing in memory...
Arun Rodrigues, Richard C. Murphy, Peter M. Kogge,...
85
Voted
ICFEM
2000
Springer
15 years 3 months ago
Formal Treatment of a Family of Fixed-Point Problems on Graphs by CafeOBJ
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
Tetsuo Tamai
IPPS
2007
IEEE
15 years 6 months ago
Software Tools for Performance Modeling of Parallel Programs
This paper presents a framework based on a user driven methodology to obtain analytical models of MPI applications on parallel systems in a systematic and easy to use way. This me...
Diego Rodriguez Martínez, Vicente Blanco P&...
100
Voted
JDA
2006
85views more  JDA 2006»
14 years 11 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger