首页    期刊浏览 2024年11月30日 星期六
登录注册

文章基本信息

  • 标题:Mixed-Criticality Scheduling to Minimize Makespan
  • 本地全文:下载
  • 作者:Sanjoy Baruah ; Arvind Easwaran ; Zhishan Guo
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2016
  • 卷号:65
  • 页码:7:1-7:13
  • DOI:10.4230/LIPIcs.FSTTCS.2016.7
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要: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.
  • 关键词:Scheduling; Mixed criticality; Identical parallel machines; Makespan minimization; Approximation algorithm.
国家哲学社会科学文献中心版权所有