Minimizing stack usage for AUTOSAR/OSEK's restricted fixed-priority preemption threshold support

被引:0
|
作者
Hatvani, Leo [1 ]
Bril, Reinder J. [1 ]
机构
[1] Tech Univ Eindhoven, Dept Math & Comp Sci, Eindhoven, Netherlands
关键词
TASKS;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Fixed priority preemption threshold scheduling (FPTS) may significantly improve the schedulability ratio of task sets compared to both fixed-priority pre-emptive scheduling (FPPS) and fixed-priority non-preemptive scheduling (FPNS). Moreover, FPTS reduces stack memory requirements compared to FPPS. Unfortunately, the scheduling policy defined by the standard automotive platform AUTOSAR/OSEK only supports a restricted version of FPTS. In earlier work, the consequences of these limitations have been investigated for the schedulability ratio of task sets on a uniprocessor platform. This paper considers the consequences for the stack memory requirements. To that end, it presents a preemption threshold assignment algorithm for minimizing stack usage under FPTS on an AUTOSAR/OSEK platform. The paper includes a comparative evaluation of the stack usage of FPTS without restrictions and FPTS as defined by AUTOSAR/OSEK.
引用
收藏
页数:10
相关论文
共 9 条
  • [1] Solution space for fixed-priority with preemption threshold
    Chen, JX
    Harji, A
    Buhr, P
    [J]. RTAS 2005: 11TH IEEE REAL TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2005, : 385 - 394
  • [2] Extended Support for Limited Preemption Fixed Priority Scheduling for OSEK/AUTOSAR-Compliant Operating Systems
    Becker, Matthias
    Khalilzad, Nima
    Bril, Reinder J.
    Nolte, Thomas
    [J]. 2015 10TH IEEE INTERNATIONAL SYMPOSIUM ON INDUSTRIAL EMBEDDED SYSTEMS (SIES), 2015, : 207 - 217
  • [3] Scheduling the asynchronous fixed-priority tasks with preemption threshold
    He, XiaoChuan
    Jia, Yan
    [J]. 2007 IFIP INTERNATIONAL CONFERENCE ON NETWORK AND PARALLEL COMPUTING WORKSHOPS, PROCEEDINGS, 2007, : 664 - 669
  • [4] Fault tolerant scheduling for fixed-priority tasks with preemption threshold
    Wang, L
    Wu, ZH
    Zhao, MD
    Yang, GQ
    [J]. 11TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2005, : 220 - 225
  • [5] Minimizing cache usage with fixed-priority and earliest deadline first scheduling
    Sun, Binqi
    Kloda, Tomasz
    Garcia, Sergio Arribas
    Gracioli, Giovani
    Caccamo, Marco
    [J]. REAL-TIME SYSTEMS, 2024, : 625 - 664
  • [6] Exact response-time analysis for fixed-priority preemption-threshold scheduling
    Keskin, Ugur
    Bril, Reinder J.
    Lukkien, Johan J.
    [J]. 2010 IEEE CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2010,
  • [7] Applying fixed-priority preemptive scheduling with preemption threshold to asynchronous event handling in the RTSJ
    Kim, MinSeong
    Wellings, Andy
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2011, 23 (14): : 1609 - 1622
  • [8] Global Fixed Priority Scheduling with Preemption Threshold: Schedulability Analysis and Stack Size Minimization
    Wang, Chao
    Gu, Zonghua
    Zeng, Haibo
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (11) : 3242 - 3255
  • [9] Minimizing Stack Memory for Hard Real-Time Applications on Multicore Platforms with Partitioned Fixed-Priority or EDF Scheduling
    Wang, Chao
    Dong, Chuansheng
    Zeng, Haibo
    Gu, Zonghua
    [J]. ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2016, 21 (03)