Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization

Pontus Ekberg, Wang Yi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

A central problem in real-time scheduling theory is to decide whether a sporadic task system with constrained deadlines is feasible on a preemptive uniprocessor.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE 36th Real-Time Systems Symposium, RTSS 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages87-95
Number of pages9
ISBN (Electronic)9781467395076
DOIs
StatePublished - 14 Jan 2016
Externally publishedYes
Event36th IEEE Real-Time Systems Symposium, RTSS 2015 - San Antonio, United States
Duration: 1 Dec 20154 Dec 2015

Publication series

NameProceedings - Real-Time Systems Symposium
Volume2016-January
ISSN (Print)1052-8725

Conference

Conference36th IEEE Real-Time Systems Symposium, RTSS 2015
Country/TerritoryUnited States
CitySan Antonio
Period1/12/154/12/15

Keywords

  • complexity
  • feasibility
  • periodic
  • real-time
  • scheduling
  • sporadic

Fingerprint

Dive into the research topics of 'Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization'. Together they form a unique fingerprint.

Cite this