936 search results - page 53 / 188 » Task Graph Scheduling Using Timed Automata |
128
click to vote
ISQED
2008
IEEE
15 years 7 months ago
2008
IEEE
—Power and energy consumption has emerged as the premier and most constraining aspect in modern computational systems. Dynamic Voltage Scheduling (DVS) has been provably one of t...
109
click to vote
RTSS
2005
IEEE
15 years 7 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
110
click to vote
RTSS
1999
IEEE
15 years 5 months ago
1999
IEEE
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
127
click to vote
ECRTS
2006
IEEE
15 years 7 months ago
2006
IEEE
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified i...
ECRTS
1999
IEEE
15 years 5 months ago
1999
IEEE
Scheduling time impact on system performance increases especially when using dynamic priority algorithms, because of the enlarged computational effort at runtime. This overhead ca...