Login

Semi-partitioned mixed-criticality scheduling
Ref: CISTER_TR_161102       Publication Date: 3 to 6, Apr, 2017

Semi-partitioned mixed-criticality scheduling

Ref: CISTER_TR_161102       Publication Date: 3 to 6, Apr, 2017

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 deadline scaling. 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 prioritizes 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.

Authors:
Muhammad Ali Awan
,
Konstantinos Bletsas
,
Pedro Souto
,
Eduardo Tovar


Events:

ARCS 2017
4, Apr, 2017 >> 6, Apr, 2017
30th International Conference on Architecture of Computing Systems
Vienna, Austria


30th International Conference on Architecture of Computing Systems (ARCS 2017), Session 6: Scheduling, pp 205-218.
Vienna, Austria.

DOI:https://doi.org/10.1007/978-3-319-54999-6_16.
ISBN: 978-3-319-54999-6.

Notes: Part of the Lecture Notes in Computer Science book series (LNCS, volume 10172).



Record Date: 3, Nov, 2016