Outstanding Paper Award: Bounding and Shaping the Demand of Mixed-Criticality Sporadic Tasks

Ekberg, Pontus; Yi, Wang

doi:10.1109/ecrts.2012.24

Cited by 79 publications

(146 citation statements)

References 10 publications

Supporting

Mentioning

145

Contrasting

Order By: Relevance

“…Ekberg and Yi [4] improved upon EDF-VD by enabling and calculating distinct scale factors for different H-tasks and using a more precise demand bound function (dbf) based schedulability test [7]. This improves performance.…”

Section: Overviewmentioning

confidence: 99%

“…The calculation of the scale factors is an iterative task-by-task process. For details, see [4] [8]. Recently, Masrur et al [9] proposed using just two scale factors, to balance scheduling performance and computational complexity.…”

Section: Overviewmentioning

confidence: 99%

“…In this work we innovatively combine the deadline-scaling technique by Ekberg and Yi [4] with the existing NPS-F semi-partitioned scheduling algorithm.…”

Section: Overviewmentioning

confidence: 99%

“…As part of this work, we identify how to compute these optimal H-server budgets, using the analysis of Ekberg and Yi [4].…”

Section: System Modelmentioning

confidence: 99%

“…NPS-F is server-based, which helps provide both fairness to low-criticality tasks and strict temporal isolation between high-and low-criticality tasks. The new algorithm employs the per-task deadline scaling scheduling technique by Ekberg and Yi [4], an extension of EDF-VD [5]. NPS-F-MC allows migration among processors only for servers for low-criticality tasks, with less severe safety considerations.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Semi-partitioned Mixed-Criticality Scheduling

Awan

Bletsas

Souto

et al. 2017

Architecture of Computing Systems - ARCS 2017

View full text Add to dashboard Cite

Scheduling isolation in mixed-criticality systems is challenging without sacrificing performance. In response, we propose a scheduling approach that combines server-based semi-partitioning and deadline scaling. Semipartitioning (whereby only some tasks migrate, in a carefully managed manner), hitherto used in single criticality systems, offers good performance with low overheads. Deadline-scaling selectivelyprioritizes high-criticality tasks in parts of the schedule to ensure theirdeadlines are met even in rares case of execution time overrun. Ournew algorithm NPS-F-MC brings semi-partitioning to mixed-criticalityscheduling and uses Ekberg and Yi 19s state-ofthe-art deadline scaling approach. It ensures scheduling isolation among different-criticality tasksand only allows low-criticality task migration. We also explore variantsthat disallow migration entirely or relax the isolation between differentcriticalities (SP-EKB) in order to evaluate the performance tradeoffs associated with more flexible or rigid safety and isolation requirements. Semi-partitioned mixed-criticality schedulingMuhammad Ali Awan * + , Konstantinos Bletsas * + , Pedro F. Souto ‡ * and Eduardo Tovar * + * CISTER/INESC-TEC Research Centre, Porto, Portugal + ISEP/IPP, Porto ‡ Faculty of Engineering, University of Porto Abstract. Scheduling isolation in mixed-criticality systems is challenging without sacrificing performance. In response, we propose a scheduling approach that combines server-based semi-partitioning and deadlinescaling. Semi-partitioning (whereby only some tasks migrate, in a carefully managed manner), hitherto used in single criticality systems, offers good performance with low overheads. Deadline-scaling selectively prioritise high-criticality tasks in parts of the schedule to ensure their deadlines are met even in rares case of execution time overrun. Our new algorithm NPS-F-MC brings semi-partitioning to mixed-criticality scheduling and uses Ekberg and Yi's state-of-the-art deadline scaling approach. It ensures scheduling isolation among different-criticality tasks and only allows low-criticality task migration. We also explore variants that disallow migration entirely or relax the isolation between different criticalities (SP-EKB) in order to evaluate the performance tradeoffs associated with more flexible or rigid safety and isolation requirements.

show abstract

Section: Overviewmentioning

confidence: 99%

Section: Overviewmentioning

confidence: 99%

“…In this work we innovatively combine the deadline-scaling technique by Ekberg and Yi [4] with the existing NPS-F semi-partitioned scheduling algorithm.…”

Section: Overviewmentioning

confidence: 99%

“…As part of this work, we identify how to compute these optimal H-server budgets, using the analysis of Ekberg and Yi [4].…”

Section: System Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Semi-partitioned Mixed-Criticality Scheduling

Awan

Bletsas

Souto

et al. 2017

Architecture of Computing Systems - ARCS 2017

View full text Add to dashboard Cite

show abstract

Memory-Aware Scheduling for Mixed-Criticality Systems

Zheng

Wang

2016

Computational Science and Its Applications – ICCSA 2016

View full text Add to dashboard Cite

DOL-BIP-Critical: a tool chain for rigorous design and implementation of mixed-criticality multi-core systems

Giannopoulou

Poplavko

Socci

et al. 2018

Des Autom Embed Syst

View full text Add to dashboard Cite

Mixed-criticality systems are promoted in industry due to their potential to reduce size, weight, power, and cost. Nonetheless, deploying mixed-criticality applications on commercial multi-core platforms remains a highly challenging problem. To name a few reasons: (i) Industrial mixed-criticality applications are usually complex reactive applications, which cannot be specified by traditional, e.g., dataflow-based, models of computation. Appropriate mixed-criticality models of computation built upon Vestal's assumptions are missing; (ii) Scheduling such applications on multicores with shared resources, such as memory buses, requires that any timing interference among applications of different criticality is bounded in order to guarantee-the necessary for certification-temporal isolation and to enable incremental design; (iii) The implementation of isolation-preserving mixed-criticality schedulers is itself subject to certification. Hence, it needs to be not only efficient, but also provably correct. This paper proposes, for the first time, a complete design flow covering all aspects from specification, using a novel mixed-criticality aware model of computation (DOL-Critical), to correct-by-construction implementation, using the principle 'what you verify is what you generate' which is based on a novel variant of task automata (BIP). We demonstrate the applicability of our design flow with an industrial avionic test case on the state-of-the-art Kalray MPPA R-256. Keywords real-time systems • mixed-criticality systems • multi-core scheduling • rigorous design • software synthesis • avionics

show abstract

Outstanding Paper Award: Bounding and Shaping the Demand of Mixed-Criticality Sporadic Tasks

Cited by 79 publications

References 10 publications

Semi-partitioned Mixed-Criticality Scheduling

Semi-partitioned Mixed-Criticality Scheduling

Memory-Aware Scheduling for Mixed-Criticality Systems

DOL-BIP-Critical: a tool chain for rigorous design and implementation of mixed-criticality multi-core systems

Contact Info

Product

Resources

About