155 search results - page 3 / 31 » On Schedulability Bounds of Static Priority Schedulers |
RTSS
1997
IEEE
13 years 10 months ago
1997
IEEE
Static-priority scheduling is popular for traffic scheduling in ATM switches because it is less costly than dynamic priority scheduling while being sensitive to the delay constra...
EMSOFT
2001
Springer
13 years 10 months ago
2001
Springer
: Run-time executives and operating system kernels for embedded systems have long relied exclusively on static priority scheduling of tasks to ensure timing constraints and other c...
INFOCOM
1997
IEEE
13 years 10 months ago
1997
IEEE
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
IPPS
2007
IEEE
14 years 15 days ago
2007
IEEE
The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared “open...
RTSS
2005
IEEE
13 years 11 months ago
2005
IEEE
This paper focuses on the hierarchical scheduling of systems where a number of separate applications reside on a single processor. It addresses the particular case where fixed pri...