Analysis of Worst Case DMA Response Time in a Fixed-Priority Bus Arbitration Protocol

被引:0
|
作者
Joosun Hahn
Rhan Ha
Sang Lyul Min
Jane W.-S. Liu
机构
[1] Seoul National University,School of Electrical Engineering and Computer Science
[2] Hong-Ik University,Department of Computer Engineering
[3] Seoul National University,School of Computer Science and Engineering
[4] Microsoft Corporation,OS Base Core Technology Group
来源
Real-Time Systems | 2002年 / 23卷
关键词
real-time system; DMA; timing analysis; fixed priority; maximum arrival function;
D O I
暂无
中图分类号
学科分类号
摘要
We propose a technique for finding the worst case response time (WCRT) of a DMA request that is needed in the schedulability analysis of a whole real-time system. The technique consists of three steps. In the first step, we find the worst case bus usage pattern of each CPU task. Then in the second step, we combine the worst case bus usage patterns of CPU tasks to construct the worst case bus usage pattern of the CPU. This second step considers not only the bus requests made by CPU tasks individually but also those due to preemptions among the CPU tasks. Finally, in the third step, we use the worst case bus usage pattern of the CPU to derive the WCRT of DMA requests assuming the fixed-priority bus arbitration protocol. Experimental results show that overestimation of the DMA response time by the proposed technique is within 20% for most DMA request sizes and that the percentage overestimation decreases as the DMA request size increases.
引用
收藏
页码:209 / 238
页数:29
相关论文
共 50 条
  • [1] Analysis of worst case DMA response time in a fixed-priority bus arbitration protocol
    Hahn, J
    Ha, R
    Min, SL
    Liu, JWS
    [J]. REAL-TIME SYSTEMS, 2002, 23 (03) : 209 - 238
  • [2] Worst-case response time analysis for partitioned fixed-priority DAG tasks on identical processors
    Ben-Amor, Slim
    Cucu-Grosjean, Liliana
    Maxim, Dorin
    [J]. 2019 24TH IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2019, : 1423 - 1426
  • [3] Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
    Reinder J. Bril
    Johan J. Lukkien
    Wim F. J. Verhaegh
    [J]. Real-Time Systems, 2009, 42 : 63 - 119
  • [4] Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
    Bril, Reinder J.
    Lukkien, Johan J.
    Verhaegh, Wim F. J.
    [J]. REAL-TIME SYSTEMS, 2009, 42 (1-3) : 63 - 119
  • [5] Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption revisited
    Bril, Reinder J.
    Lukkien, Johan J.
    Verhaegh, Wim F. J.
    [J]. 19TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2007, : 269 - +
  • [6] Exact Response Time Analysis of Hierarchical Fixed-Priority Scheduling
    Balbastre, Patricia
    Ripoll, Ismael
    Crespo, Alfons
    [J]. 2009 15TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2009, : 315 - 320
  • [7] Improving the Response Time Analysis of Global Fixed-Priority Multiprocessor Scheduling
    Sun, Youcheng
    Lipari, Giuseppe
    Guan, Nan
    Yi, Wang
    [J]. 2014 IEEE 20TH INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS (RTCSA), 2014,
  • [8] Response Time Analysis for Fixed-Priority Tasks with Multiple Probabilistic Parameters
    Maxim, Dorin
    Cucu-Grosjean, Liliana
    [J]. IEEE 34TH REAL-TIME SYSTEMS SYMPOSIUM (RTSS 2013), 2013, : 224 - 235
  • [9] Response Time Stochastic Analysis for Fixed-Priority Stable Real-Time Systems
    Zagalo, Kevin
    Abdeddaim, Yasmina
    Bar-Hen, Avner
    Cucu-Grosjean, Liliana
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2023, 72 (01) : 3 - 14
  • [10] Worst case response time analysis of sporadic graph tasks with fixed priority scheduling on a uniprocessor
    Zhao, HX
    Midonnet, S
    George, L
    [J]. 11TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2005, : 23 - 29