Journal Article
@Article
Artikel in Fachzeitschrift


Show entries of:

this year (2014) | last year (2013) | two years ago (2012) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor(s)

Author(s):

Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen

dblp
dblp
dblp
dblp
dblp
dblp
dblp

Not MPG Author(s):

Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Stougie, Leen

BibTeX cite key*:

Megow2011-MCsched

Title

Title*:

Scheduling Real-Time Mixed-Criticality Jobs

Journal

Journal Title*:

IEEE Transactions on Computers

Journal's URL:


Download URL
for the article:


Language:

English

Publisher

Publisher's
Name:

IEEE

Publisher's URL:


Publisher's
Address:

Piscataway, NJ

ISSN:

0018-9340

Vol, No, pp, Date

Volume*:

61

Number:

8

Publishing Date:

July 2012

Pages*:

1140-1152

Number of
VG Pages:


Page Start:

1140

Page End:

1152

Sequence Number:


DOI:

10.1109/TC.2011.142

Note, Abstract, ©

Note:


(LaTeX) Abstract:

Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such "mixed-criticality” systems give rise to interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional scheduling theory. In this paper, we study a formal model for representing such mixed-criticality workloads. We demonstrate first the intractability of determining whether a system specified in this model can be scheduled to meet all its certification requirements, even for systems subject to merely two sets of certification requirements. Then we quantify, via the metric of processor speedup factor, the effectiveness of two techniques, reservation-based scheduling and priority-based scheduling, that are widely used in scheduling such mixed-criticality systems, showing that the latter of the two is superior to the former. We also show that the speedup factors we obtain are tight for these two techniques.

URL for the Abstract:


Categories,
Keywords:


HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort


BibTeX Entry:

@ARTICLE{Megow2011-MCsched,
AUTHOR = {Baruah, Sanjoy and Bonifaci, Vincenzo and D'Angelo, Gianlorenzo and Li, Haohan and Marchetti-Spaccamela, Alberto and Megow, Nicole and Stougie, Leen},
TITLE = {Scheduling Real-Time Mixed-Criticality Jobs},
JOURNAL = {IEEE Transactions on Computers},
PUBLISHER = {IEEE},
YEAR = {2012},
NUMBER = {8},
VOLUME = {61},
PAGES = {1140--1152},
ADDRESS = {Piscataway, NJ},
MONTH = {July},
ISBN = {0018-9340},
DOI = {10.1109/TC.2011.142},
}


Entry last modified by Anja Becker, 01/25/2013
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Attachment SectionAttachment Section