Cache related pre-emption delays in hierarchical scheduling

被引:6
作者
Lunniss, Will [1 ]
Altmeyer, Sebastian [2 ]
Lipari, Giuseppe [3 ,4 ]
Davis, Robert I. [1 ]
机构
[1] Univ York, Dept Comp Sci, York YO10 5DD, N Yorkshire, England
[2] Univ Luxembourg, LASSY Grp, Luxembourg, Luxembourg
[3] Univ Lille, CRIStAL, UMR 9189, F-59650 Villeneuve Dascq, France
[4] IRCICA, USR 3380, F-59650 Villeneuve Dascq, France
基金
英国工程与自然科学研究理事会;
关键词
Cache related pre-emption delays; Hierarchical scheduling; Fixed priority pre-emptive scheduling; Earliest deadline first pre-emptive scheduling; Response time analysis; REAL-TIME SYSTEMS; ALGORITHMS;
D O I
10.1007/s11241-015-9228-x
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. This has become a popular technique in industry as it allows applications from multiple vendors as well as legacy applications to co-exist in isolation on the same platform. However, performance enhancing features such as caches mean that one application can interfere with another by evicting blocks from cache that were in use by another application, violating the requirement of temporal isolation. In this paper, we present analysis that bounds the additional delay due to blocks being evicted from cache by other applications in a system using hierarchical scheduling when using either a local FP or EDF scheduler.
引用
收藏
页码:201 / 238
页数:38
相关论文
共 46 条
  • [1] Altmeyer S., 2011, Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium (RTSS 2011), P261, DOI 10.1109/RTSS.2011.31
  • [2] Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
    Altmeyer, Sebastian
    Davis, Robert I.
    Maiza, Claire
    [J]. REAL-TIME SYSTEMS, 2012, 48 (05) : 499 - 526
  • [3] Altmeyer S, 2010, LCTES 10-PROCEEDINGS OF THE ACM SIGPLAN/SIGBED 2010 CONFERENCE ON LANGUAGES, COMPILERS, & TOOLS FOR EMBEDDED SYSTEMS, P153
  • [4] [Anonymous], 2005, J EMBEDDED COMPUT
  • [5] ARINC, 1996, 653 ARINC AEEC
  • [6] *ARINC, 1991, 651 ARINC AEEC
  • [7] Asberg M, 2013, P 21 INT C REAL TIM
  • [8] 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
  • [9] ALGORITHMS AND COMPLEXITY CONCERNING THE PREEMPTIVE SCHEDULING OF PERIODIC, REAL-TIME TASKS ON ONE PROCESSOR
    BARUAH, SK
    ROSIER, LE
    HOWELL, RR
    [J]. REAL-TIME SYSTEMS, 1990, 2 (04) : 301 - 324
  • [10] BARUAH SK, 1990, PROCEEDINGS : 11TH REAL-TIME SYSTEMS SYMPOSIUM, P182, DOI 10.1109/REAL.1990.128746