Bounding Demand Paging Costs in Fixed Priority Real-Time Systems

Authors:
Young-Ho Lee;Hoyoung Hwang;Kanghee Kim;Sung-Soo Lim
Affiliations:
School of Computer Engineering, Kookmin University, Jungrung 3-dong, Seongbuk-gu, Seoul, 136-702, Korea;Department of Multimdia Engineering, Hansung University, Samsun-Dong 3Ga 389, Sungbook-Gu, Seoul, 136-792, Korea;Mobile Communication Division, Telecommunication Network Business, Samsung Electronics Co., LTD.,;School of Computer Engineering, Kookmin University, Jungrung 3-dong, Seongbuk-gu, Seoul, 136-702, Korea
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Year:
2007

Citing 4
Cited 0

An extendible approach for analyzing fixed priority hard real-time tasks

Real-Time Systems
Adaptive caching for demand prepaging

Proceedings of the 3rd international symposium on Memory management
Adding instruction cache effect to schedulability analysis of preemptive real-time systems

RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
Schedulability Analysis for Tasks with Static and Dynamic Offsets

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

In real-time systems, demand paging has not been used since worst case performance analysis technique for demand paging is not available. In this paper, we propose a technique to obtain the worst case bound on the demand paging costs and devise a worst case response time analysis framework considering the demand paging costs. We divide the technique into two different methods, DP-Pessimistic and DP-Accurate, depending on the accuracy and the complexity of analysis. DP-Accurate considers the page reuses among task instances and thus gives more accurate analysis results. We evaluate the accuracy of the proposed techniques comparing the analysis results from DP-Accurate and DP-Pessimistic.