10 search results - page 1 / 2 » A Synthetic Utilization Bound for Aperiodic Tasks with Resou... |
ECRTS
2003
IEEE
13 years 10 months ago
2003
IEEE
Utilization bounds for schedulability of aperiodic tasks are new in real-time scheduling literature. All aperiodic bounds known to date apply only to independent tasks. They eithe...
RTAS
2002
IEEE
13 years 9 months ago
2002
IEEE
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough ...
RTCSA
2003
IEEE
13 years 10 months ago
2003
IEEE
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...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Visual recognition and detection are computationally intensive tasks and current research efforts primarily focus on solving them without considering the computational capability ...
RTAS
2008
IEEE
13 years 11 months ago
2008
IEEE
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...