91 search results - page 9 / 19 » Automatic Data-Flow Graph Generation of MPI Programs |
124
click to vote
CPAIOR
2010
Springer
14 years 7 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
IISWC
2009
IEEE
15 years 4 months ago
2009
IEEE
—Communication traces are integral to performance modeling and analysis of parallel programs. However, execution on a large number of nodes results in a large trace volume that i...
ENTCS
2006
14 years 9 months ago
2006
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
107
click to vote
ISPAN
2002
IEEE
15 years 2 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
154
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...