359 search results - page 13 / 72 » Order Scheduling Models: Hardness and Algorithms |
DAC
1999
ACM
14 years 8 months ago
1999
ACM
Software synthesis from a concurrent functional specification is a key problem in the design of embedded systems. A concurrent specification is well-suited for medium-grained part...
CHARME
2001
Springer
13 years 11 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
In a real-time system, tasks are constrained by global endto-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over compon...
IDEAS
2002
IEEE
14 years 17 days ago
2002
IEEE
A new quality of service (QoS) aware disk scheduling algorithm is presented. It is applicable in environments where data requests arrive with different QoS requirements such as re...
GECCO
1999
Springer
13 years 12 months ago
1999
Springer
This paper describes the application of an arti cial immune system, AIS , model to a scheduling application, in which sudden changes in the scheduling environment require the rap...