A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
J. Christopher Beck, Tom Carchrae, Eugene C. Freud...
The state of the art in verifying the real-time requirements of applications developed using general processing graph models relies on simulation or off-line scheduling. We extend...
Telecommunication networks process verylarge numbers of events in real time. In this environment, database applications demand both high throughput (at reasonable costs), and pred...
Jerry Baulier, Stephen Blott, Henry F. Korth, Abra...
In this paper we propose a novel scheduling framework for a real-timeenvironmentthat experiences dynamic changes. Thisframework is capable of adjusting the system workload in incr...
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...