| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 129.34 KB | Adobe PDF |
Advisor(s)
Abstract(s)
There is an increasing demand for highly dynamic realtime
systems where several independently developed applications
with different timing requirements can coexist. This
paper proposes a protocol to integrate shared resources and
precedence constraints among tasks in such systems assuming
no precise information on critical sections and computation
times is available. The concept of bandwidth inheritance
is combined with a capacity sharing and stealing
mechanism to efficiently exchange bandwidth among
needed tasks, minimising the cost of blocking.