FFOB: efficient online mode-switch procrastination in mixed-criticality systems

被引:13
作者
Hu, Biao [1 ]
Thiele, Lothar [4 ]
Huang, Pengcheng [4 ]
Huang, Kai [2 ]
Griesbeck, Christoph [3 ]
Knoll, Alois [3 ]
机构
[1] Beijing Univ Chem Technol, Coll Informat Sci & Technol, Beijing 100029, Peoples R China
[2] Sun Yat Sen Univ, Sch Data & Comp Sci, Guangzhou 510006, Guangdong, Peoples R China
[3] Tech Univ Munich, Informat, Embedded Syst & Robot, Munich, Germany
[4] Swiss Fed Inst Technol, Comp Engn & Commun Networks Lab, Zurich, Switzerland
基金
中国国家自然科学基金;
关键词
Mixed-criticality systems; Overrun budgeting scheme; Task procrastination techniques; Slack reclaim;
D O I
10.1007/s11241-018-9323-x
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In mixed-criticality scheduling, the widely adopted mode-switch scheme assumes that both high- and low-criticality tasks are schedulable when no tasks overrun (normal mode) and all high-criticality tasks are schedulable even when they overrun (critical mode, where low-criticality tasks are abandoned/degraded). However, this scheme greatly impedes the system performance because triggering a mode-switch immediately after any task overruns is abrupt and pessimistic. It is urgent to solve this problem as the mode-switch scheme is a fundamental part in the mixed-criticality scheduling. In this article, we present an on-the-fly fast overrun budgeting mechanism for both, earliest-deadline-first scheduled and fixed-priority scheduled systems that can effectively keep the system away from the critical mode. Our main idea is to perform overrun budgeting for all tasks as a whole, by monitoring task executions and updating a common overrun budget. This way, the overrun budget is shared among all tasks and adaptively replenished by leveraging run-time information; consequently, mode-switch can be postponed as much as possible. Both, extensive simulations and real-life deployments demonstrate that our proposed mode-switch scheme is lightweight and significantly outperforms existing solutions in improving the system's quality of service for low-criticality tasks.
引用
收藏
页码:471 / 513
页数:43
相关论文
共 47 条
  • [1] APPLYING NEW SCHEDULING THEORY TO STATIC PRIORITY PREEMPTIVE SCHEDULING
    AUDSLEY, N
    BURNS, A
    RICHARDSON, M
    TINDELL, K
    WELLINGS, AJ
    [J]. SOFTWARE ENGINEERING JOURNAL, 1993, 8 (05): : 284 - 292
  • [2] On priority assignment in fixed priority scheduling
    Audsley, NC
    [J]. INFORMATION PROCESSING LETTERS, 2001, 79 (01) : 39 - 44
  • [3] Awan MA, 2013, C REAL TIM NETW SYST
  • [4] Awan MA, 2011, EUR C REAL TIM SYST
  • [5] Barhorst J, 2009, CYBER PHYS SYST WEEK, V12
  • [6] The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems
    Baruah, S.
    Bonifaci, V.
    D'Angelo, G.
    Li, H.
    Marchetti-Spaccamela, A.
    van der Ster, S.
    Stougie, L.
    [J]. PROCEEDINGS OF THE 24TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS (ECRTS 2012), 2012, : 145 - 154
  • [7] Baruah S.K., 2011, REAL TIM SYST S RTSS
  • [8] Scheduling Real-Time Mixed-Criticality Jobs
    Baruah, Sanjoy
    Bonifaci, Vincenzo
    D'Angelo, Gianlorenzo
    Li, Haohan
    Marchetti-Spaccamela, Alberto
    Megow, Nicole
    Stougie, Leen
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2012, 61 (08) : 1140 - 1152
  • [9] Baruah SK, 2011, ALGORITHMS ESA
  • [10] Baruah SK, 1990, REAL TIM SYST S RTSS