English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Scheduling Real-time Mixed-criticality Jobs

Baruah, S., Bonifaci, V., D'Angelo, G., Li, H., Marchetti-Spaccamela, A., Megow, N., et al. (2010). Scheduling Real-time Mixed-criticality Jobs. In P. Hliněný, & A. Kučera (Eds.), Mathematical Foundations of Computer Science 2010 (pp. 90-101). Berlin: Springer. doi:10.1007/978-3-642-15155-2.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-16DF-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-28A4-8
Genre: Conference Paper

Files

show Files
hide Files
:
MCscheduling-mfcs-final.pdf (Any fulltext), 319KB
 
File Permalink:
-
Name:
MCscheduling-mfcs-final.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Baruah, Sanjoy1, Author
Bonifaci, Vincenzo2, Author           
D'Angelo, Gianlorenzo1, Author
Li, Haohan1, Author
Marchetti-Spaccamela, Alberto1, Author
Megow, Nicole2, Author           
Stougie, Leen1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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 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 are tight for these two techniques.

Details

show
hide
Language(s): eng - English
 Dates: 20102010
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 536755
DOI: 10.1007/978-3-642-15155-2
URI: http://dx.doi.org/10.1007/978-3-642-15155-2_10
Other: Local-ID: C1256428004B93B8-2286C7D71CA98070C12577FF0059CA54-Bonifaci:2010:c
 Degree: -

Event

show
hide
Title: 35th International Symposium on Mathematical Foundations of Computer Science
Place of Event: Brno, Czech Republic
Start-/End Date: 2010-08-23 - 2010-08-27

Legal Case

show

Project information

show

Source 1

show
hide
Title: Mathematical Foundations of Computer Science 2010
  Abbreviation : MFCS 2010
  Subtitle : 35th International Symposium, MFCS 2010
Source Genre: Proceedings
 Creator(s):
Hliněný, Petr1, Editor
Kučera, Antonín1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 90 - 101 Identifier: ISBN: 3-642-15154-X

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 6281 Sequence Number: - Start / End Page: - Identifier: -