Please use this identifier to cite or link to this item:
Title: Mixed-criticality scheduling to minimize makespan
Authors: Guo, Zhishan
Easwaran, Arvind
Baruah, Sanjoy
Keywords: DRNTU::Engineering::Computer science and engineering
Mixed Criticality
Issue Date: 2016
Source: Baruah, S., Easwaran, A., & Guo, Z. (2016). Mixed-criticality scheduling to minimize makespan. Leibniz International Proceedings in Informatics, 65, 7-. doi:10.4230/LIPIcs.FSTTCS.2016.7
Series/Report no.: Leibniz International Proceedings in Informatics
Abstract: In the mixed-criticality job model, each job is characterized by two execution time parameters, representing a smaller (less conservative) estimate and a larger (more conservative) estimate on its actual, unknown, execution time. Each job is further classified as being either less critical or more critical. The desired execution semantics are that all jobs should execute correctly provided all jobs complete upon being allowed to execute for up to the smaller of their execution time estimates, whereas if some jobs need to execute beyond their smaller execution time estimates (but not beyond their larger execution time estimates), then only the jobs classified as being more critical are required to execute correctly. The scheduling of collections of such mixed-criticality jobs upon identical multiprocessor platforms in order to minimize the makespan is considered here.
DOI: 10.4230/LIPIcs.FSTTCS.2016.7
Rights: © 2016 Sanjoy Baruah, Arvind Easwaran, and Zhishan Guo; licensed under Creative Commons License CC-BY
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Journal Articles

Files in This Item:
File Description SizeFormat 
Mixed-criticality scheduling to minimize makespan.pdf518.51 kBAdobe PDFThumbnail

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.