130 search results - page 5 / 26 » Algorithms and Complexity for Periodic Real-Time Scheduling |
157
click to vote
ICPPW
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— In the sporadic task model, a task is characterized by three parameters — an execution requirement, a relative deadline, and a period parameter — and has the interp...
127
Voted
ECRTS
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper investigates real-time scheduling in a system whose energy reservoir is replenished by an environmental power source. The execution of tasks is deemed primarily energy-...
145
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...
169
click to vote
WADS
2001
Springer
15 years 8 months ago
2001
Springer
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...
167
Voted
ICCAD
2001
IEEE
16 years 13 days 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...