1673 search results - page 189 / 335 » Generalized Elastic Scheduling |
162
click to vote
ICCAD
1998
IEEE
15 years 10 months ago
1998
IEEE
In this paper, an approach to symbolic model checking of process networks is introduced. It is based on interval decision diagrams (IDDs), a representation of multi-valued functio...
148
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...
173
click to vote
ECRTS
2004
IEEE
15 years 10 months ago
2004
IEEE
Most previous research done in probabilistic schedulability analysis assumes a known distribution of execution times for each task of a real-time application. This is however not ...
180
click to vote
LATIN
2000
Springer
15 years 10 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
173
click to vote
ARC
2008
Springer
15 years 8 months ago
2008
Springer
We present an improved method for scheduling speculative data paths which relies on cancel tokens to undo computations in misspeculated paths. Performancewise, this method is consi...