204 search results - page 15 / 41 » Scheduling Periodic Tasks in a Hard Real-Time Environment |
ICPP
1998
IEEE
15 years 2 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...
102
click to vote
ICDCS
2002
IEEE
15 years 2 months ago
2002
IEEE
In the real-time environments, information is disseminated to clients with timing constraint. In this paper, we focus on the real time data scheduling problem in multiple broadcas...
WORDS
2002
IEEE
15 years 2 months ago
2002
IEEE
Certainly, in hard real-time systems, it is reasonable to argue that no hard real-time threads should behave in an unpredictable way and that schedulability should be guaranteed b...
108
click to vote
TC
2008
14 years 9 months ago
2008
The periodic update transaction model has been used to maintain the freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus of pa...
117
click to vote
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
- Real-time scheduling on processors that support dynamic voltage and frequency scaling is analyzed. The Slacked Earliest Deadling First (SEDF) algorithm is proposed and it is show...