ON THE COMPLEXITY OF FIXED-PRIORITY SCHEDULING OF REAL-TIME TASKS.

J. Y.T. Leung, J. Whitehead

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish (US)
Pages464-470
Number of pages7
StatePublished - 1981
EventProc Annu Allerton Conf Commun Control Comput 18th - Monticello, IL, USA
Duration: Oct 8 1980Oct 11 1980

Conference

ConferenceProc Annu Allerton Conf Commun Control Comput 18th
CityMonticello, IL, USA
Period10/8/8010/11/80

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'ON THE COMPLEXITY OF FIXED-PRIORITY SCHEDULING OF REAL-TIME TASKS.'. Together they form a unique fingerprint.

Cite this