uu.seUppsala universitets publikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Uniprocessor feasibility of sporadic tasks remains coNP-complete under bounded utilization
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. (Embedded Systems)
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. (Embedded Systems)
2015 (engelsk)Inngår i: Proc. 36th Real-Time Systems Symposium, IEEE Computer Society, 2015, s. 87-95Konferansepaper, Publicerat paper (Fagfellevurdert)
sted, utgiver, år, opplag, sider
IEEE Computer Society, 2015. s. 87-95
HSV kategori
Forskningsprogram
Datavetenskap med inriktning mot realtidssystem
Identifikatorer
URN: urn:nbn:se:uu:diva-265784DOI: 10.1109/RTSS.2015.16ISI: 000380424600009ISBN: 978-1-4673-9507-6 (digital)OAI: oai:DiVA.org:uu-265784DiVA, id: diva2:866563
Konferanse
RTSS 2015, December 1–4, San Antonio, TX
Prosjekter
UPMARCTilgjengelig fra: 2016-01-18 Laget: 2015-11-03 Sist oppdatert: 2018-01-10bibliografisk kontrollert
Inngår i avhandling
1. Models and Complexity Results in Real-Time Scheduling Theory
Åpne denne publikasjonen i ny fane eller vindu >>Models and Complexity Results in Real-Time Scheduling Theory
2015 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
Abstract [en]

When designing real-time systems, we want to prove that they will satisfy given timing constraints at run time. The main objective of real-time scheduling theory is to analyze properties of mathematical models that capture the temporal behaviors of such systems. These models typically consist of a collection of computational tasks, each of which generates an infinite sequence of task activations. In this thesis we study different classes of models and their corresponding analysis problems.

First, we consider models of mixed-criticality systems. The timing constraints of these systems state that all tasks must meet their deadlines for the run-time scenarios fulfilling certain assumptions, for example on execution times. For the other scenarios, only the most important tasks must meet their deadlines. We study both tasks with sporadic activation patterns and tasks with complicated activation patterns described by arbitrary directed graphs. We present sufficient schedulability tests, i.e., methods used to prove that a given collection of tasks will meet their timing constraints under a particular scheduling algorithm.

Second, we consider models where tasks can lock mutually exclusive resources and have activation patterns described by directed cycle graphs. We present an optimal scheduling algorithm and an exact schedulability test.

Third, we address a pair of longstanding open problems in real-time scheduling theory. These concern the computational complexity of deciding whether a collection of sporadic tasks are schedulable on a uniprocessor. We show that this decision problem is strongly coNP-complete in the general case. In the case where the asymptotic resource utilization of the tasks is bounded by a constant smaller than 1, we show that it is weakly coNP-complete.

sted, utgiver, år, opplag, sider
Uppsala: Acta Universitatis Upsaliensis, 2015. s. 32
Serie
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 1324
Emneord
Real-time systems, Scheduling theory, Task models, Computational complexity
HSV kategori
Forskningsprogram
Datavetenskap med inriktning mot inbyggda system
Identifikatorer
urn:nbn:se:uu:diva-267017 (URN)978-91-554-9423-0 (ISBN)
Disputas
2016-01-15, ITC, 2446, Lägerhyddsvägen 2, Uppsala, 13:15 (engelsk)
Opponent
Veileder
Prosjekter
UPMARC
Tilgjengelig fra: 2015-12-16 Laget: 2015-11-16 Sist oppdatert: 2019-02-25

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Ekberg, PontusYi, Wang

Søk i DiVA

Av forfatter/redaktør
Ekberg, PontusYi, Wang
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 401 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf