Abstract
The complexity of determining whether a set of periodic, real-time tasks can be scheduled on m greater than equivalent to 1 identical processors with respect to fixed-priority scheduling is considered. It is shown that the problem is NP-hard in all but one special case. The complexity of optimal fixed-priority scheduling algorithms is discussed.
| Original language | English (US) |
|---|---|
| Pages | 464-470 |
| Number of pages | 7 |
| State | Published - 1981 |
| Event | Proc Annu Allerton Conf Commun Control Comput 18th - Monticello, IL, USA Duration: Oct 8 1980 → Oct 11 1980 |
Conference
| Conference | Proc Annu Allerton Conf Commun Control Comput 18th |
|---|---|
| City | Monticello, IL, USA |
| Period | 10/8/80 → 10/11/80 |
All Science Journal Classification (ASJC) codes
- General Engineering