9 search results - page 2 / 2 » On Non-Utilization Bounds for Arbitrary Fixed Priority Polic... |
CDC
2010
IEEE
13 years 17 days ago
2010
IEEE
We consider the problem of dynamic buying and selling of shares from a collection of N stocks with random price fluctuations. To limit investment risk, we place an upper bound on t...
RTSS
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
OSDI
1996
ACM
13 years 6 months ago
1996
ACM
Traditional processor scheduling mechanisms in operating systems are fairly rigid, often supportingonly one fixed scheduling policy, or, at most, a few "scheduling classes&qu...
RTAS
2008
IEEE
13 years 12 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...