Sciweavers

11 search results - page 2 / 3
» A New Sufficient Feasibility Test for Asynchronous Real-Time...
Sort
View
RTCSA
2003
IEEE
13 years 10 months ago
Deterministic and Statistical Deadline Guarantees for a Mixed Set of Periodic and Aperiodic Tasks
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource r...
Minsoo Ryu, Seongsoo Hong
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
13 years 9 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
RTS
2006
138views more  RTS 2006»
13 years 5 months ago
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
A new feasibility test for preemptive scheduling of periodic or sporadic real-time tasks on a single-queue m-server system allows for arbitrary fixed task priorities and arbitrary...
Theodore P. Baker
RTAS
2005
IEEE
13 years 10 months ago
Energy-Aware Task Allocation for Rate Monotonic Scheduling
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...
Tarek A. AlEnawy, Hakan Aydin
RTSS
2002
IEEE
13 years 10 months ago
The Space of Rate Monotonic Schedulability
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic ...
Enrico Bini, Giorgio C. Buttazzo