Sciweavers

RTSS
2002
IEEE
14 years 4 months ago
Approximate Schedulability Analysis
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
Samarjit Chakraborty, Simon Künzli, Lothar Th...
DAC
2002
ACM
15 years 16 days ago
Schedulability of event-driven code blocks in real-time embedded systems
Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Tasks in many such systems, like netwo...
Samarjit Chakraborty, Thomas Erlebach, Simon K&uum...