Mixed-criticality scheduling to minimize makespan

• Main Authors: Guo, Zhishan, Easwaran, Arvind, Baruah, Sanjoy
• 其他作者: School of Computer Science and Engineering
• 格式: Article
• 語言: English
• 出版: 2018
• 主題: DRNTU::Engineering::Computer science and engineering; Mixed Criticality; Scheduling
• 在線閱讀: https://hdl.handle.net/10356/89958; http://hdl.handle.net/10220/47171

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.