176 search results - page 4 / 36 » Relating Time Progress and Deadlines in Hybrid Systems |
AIPS
2003
13 years 8 months ago
2003
Scheduling algorithms for real-time systems can be characterized in various ways, one of the most important ones of which is the underlying task model. Many concepts of real-time ...
RTAS
2008
IEEE
14 years 1 months ago
2008
IEEE
A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid...
HYBRID
2004
Springer
14 years 25 days ago
2004
Springer
In this paper, we introduce a parametric semantics for timed controllers called the Almost ASAP semantics. This semantics is a relaxation of the usual ASAP3 semantics (also called ...
ECRTS
2003
IEEE
14 years 23 days ago
2003
IEEE
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an ...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
This report addresses the problem of scheduling for real-time systems that include both hard and soft tasks. In order to capture the relative importance of soft tasks and how the ...