Enhanced analysis of cache-related preemption delay in fixed-priority preemptive scheduling
- Authors
- Lee, C.-G.; Hahn, J.; Seo, Y.-M.; Min, S.L.; Ha, R.; Hong, S.; Park, C.Y.; Lee, M.; Kim, C.S.
- Issue Date
- Dec-1997
- Publisher
- IEEE, Piscataway, NJ, United States
- Citation
- Proceedings - Real-Time Systems Symposium, pp 187 - 198
- Pages
- 12
- Journal Title
- Proceedings - Real-Time Systems Symposium
- Start Page
- 187
- End Page
- 198
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/60666
- DOI
- 10.1109/REAL.1997.641281
- ISSN
- 0000-0000
- Abstract
- We propose an enhanced technique for analyzing and thus, bounding cache-related preemption delay in fixed-priority preemptive scheduling focusing on instruction caching. The proposed technique improves upon previous techniques in two important ways. First, the technique takes into account the relationship between a preempted task and the set of tasks that execute during the preemption when calculating the cache-related preemption delay. Second, the technique considers phasing of tasks to eliminate many infeasible task interactions. These two features are expressed as constraints of a linear programming problem whose solution gives a guaranteed upper bound on the cache-related preemption delay. This paper also compares the proposed technique with previous techniques. The results show that the proposed technique gives up to 60% tighter prediction of the worst case response time than the previous techniques.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/60666)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.