707 search results - page 9 / 142 » Real-Time Scheduling with a Budget |
108
click to vote
TPDS
1998
14 years 9 months ago
1998
—Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for no...
ETFA
2006
IEEE
15 years 1 months ago
2006
IEEE
Classical off-line approaches based on preemption such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedula...
ICPP
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
89
Voted
RTSS
1990
IEEE
15 years 1 months ago
1990
IEEE
Time-critical scheduling in real-time database systems has two components: real-time transaction scheduling,which is related to task scheduling in realtime operating systems, and ...
100
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...