| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 438.53 KB | Adobe PDF |
Authors
Advisor(s)
Abstract(s)
Consider the problem of scheduling real-time tasks on a multiprocessor with the goal of meeting deadlines. Tasks arrive sporadically and have implicit deadlines, that is, the deadline of a task is equal to its minimum inter-arrival time. Consider this problem to be solved with global static-priority scheduling. We present a priority-assignment scheme with the property that if at most 38% of the processing capacity is requested then all deadlines are met.
Description
Keywords
Citation
Publisher
Springer