Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-72590-9_136 | International Conference on Computational Science (4) |
Keywords | Field | DocType |
demand paging,analysis result,accurate analysis result,fixed priority real-time systems,worst case response time,analysis framework,proposed technique,worst case performance analysis,demand paging cost,bounding demand,different method,worst case,real time systems | Worst case response time,Flash memory,Computer science,Real-time computing,Page replacement algorithm,Demand paging,Bounding overwatch | Conference |
Volume | ISSN | Citations |
4490 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Young-Ho Lee | 1 | 0 | 0.34 |
| Hoyoung Hwang | 2 | 10 | 6.30 |
| Kanghee Kim | 3 | 223 | 20.24 |
| Sung-Soo Lim | 4 | 301 | 51.54 |