Analysis of cache-related preemption delay in fixed-priority preemptive scheduling

作     者：Lee, CG Hahn, J Seo, YM Min, SL Ha, R Hong, S Park, CY Lee, M Kim, CS 

作者机构：Seoul Natl Univ Dept Comp Engn Seoul 151742 South Korea Seoul Natl Univ Sch Elect Engn Seoul 151742 South Korea Hongik Univ Dept Comp Engn Seoul 121791 South Korea Chung Ang Univ Dept Comp Engn Seoul 156756 South Korea Han Sung Univ Dept Comp Engn Seoul 136792 South Korea 

出 版 物：《IEEE TRANSACTIONS ON COMPUTERS》 (IEEE Trans Comput)

年 卷 期：1998年第47卷第6期

页      面：700-713页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Seoam Scholarship Foundation Korea Science and Engineering Foundation, KOSEF, (97-01-02-05-01-3) 

主　　题：real-time system fixed-priority scheduling cache memory preemption schedulability analysis 

摘      要：We propose a technique for analyzing cache-related preemption delays of tasks that cause unpredictable variation in task execution time in the context of fixed-priority preemptive scheduling. The proposed technique consists of two steps. The first step performs a per-task analysis to estimate cache-related preemption cost for each execution point in a given task. The second step computes the worst case response time of each task that includes the cache-related preemption delay using a response time equation and a linear programming technique. This step takes as its input the preemption cost information of tasks obtained in the first step. This paper also compares the proposed approach with previous approaches. The results show that the proposed approach gives a prediction of the worst case cache-related preemption delay that is up to 60 percent tighter than those obtained from the previous approaches.