475 search results - page 34 / 95 » Feasible distributed CSP models for scheduling problems |
140
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
141
click to vote
JCSS
2007
15 years 4 months ago
2007
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
173
click to vote
PPOPP
2009
ACM
16 years 5 months ago
2009
ACM
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
140
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
144
click to vote
EMSOFT
2009
Springer
15 years 8 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...