Bounding Demand Paging Costs in Fixed Priority Real-Time Systems

摘要

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.