标题:Analyzing Data Cache Related Preemption Delay With Multiple Preemptions
作者:Zhang, Wei; Guan, Nan; Ju, Lei; Liu, Weichen
通讯作者:Zhang, W;Zhang, Wei
作者机构:[Zhang, Wei; Guan, Nan] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China.; [Ju, Lei] Shandong Univ, Sch Software, Jinan 250 更多
会议名称:Embedded Syst Week (ESWEEK) / Int Conf on Compilers, Architecture, and Synthesis for Embedded Syst (CASES) / Int Conf on Hardware/Software Codesign and Syst Synthesis (CODES+ISSS) / ACM SIGBED Int Conf on Embedded Software (EMSOFT)
会议日期:MAR 27-APR 03, 2018
来源:IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
出版年:2018
卷:37
期:11
页码:2255-2265
DOI:10.1109/TCAD.2018.2857079
关键词:Cache-related preemption delay (CRPD); data cache; real-time systems;; timing analysis
摘要:Timing analysis of real-time tasks under preemptive scheduling must take cache-related preemption delay (CRPD) into account. Typically, a task may be preempted more than once during the execution in each period. To bound the total CRPD of k preemptions, existing CRPD analysis techniques estimate the CRPD at each program point, and use the sum of the k-largest CRPD among all program points as the total CRPD upper bound. In this paper, we disclose that the above-mentioned approach, although works well for instruction caches, leads to significant overestimation when dealing with data caches. This is because on data caches, the CRPD of preemptions at different program points may have correlations, and the total CRPD of multiple preemptions is in general smaller than the simple sum of the worst-case CRPD of each preemption. To address this problem, we propose a new technique to efficiently explore the correlation among the CRPD of different preemptions, and thus more precisely calculate the total CRPD. Experiments with benchmark programs show that the proposed technique leads to substantially tighter total CRPD estimation with multiple preemptions comparing with the state-of-the-art.
收录类别:CPCI-S;EI;SCOPUS;SCIE
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85055274331&doi=10.1109%2fTCAD.2018.2857079&partnerID=40&md5=bc1943faf549fa9b6a19f1ace24bb236
TOP