936 search results - page 72 / 188 » Task Graph Scheduling Using Timed Automata |
222
click to vote
RTAS
2011
IEEE
14 years 5 months ago
2011
IEEE
The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of...
124
click to vote
ECRTS
2005
IEEE
15 years 7 months ago
2005
IEEE
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...
129
click to vote
LATA
2009
Springer
15 years 8 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
139
click to vote
RTAS
2011
IEEE
14 years 4 months ago
2011
IEEE
—It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with...
120
click to vote
IJCAI
2003
15 years 2 months ago
2003
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...