91 search results - page 14 / 19 » Automatic Data-Flow Graph Generation of MPI Programs |
ERSHOV
2009
Springer
13 years 11 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
ICST
2010
IEEE
13 years 6 months ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
LCTRTS
2005
Springer
14 years 1 months ago
2005
Springer
Effective use of the memory hierarchy is critical for achieving high performance on embedded systems. We focus on the class of streaming applications, which is increasingly preval...