Non-OS 임베디드 시스템에서 개선된 알고리즘을 적용한 요구 페이징 기법
Demand Paging Method Using Improved Algorithms on Non-OS Embedded System
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper, we try to improve the performance of the demand paging loader suggested to use the demand paging way that is not based on operating system. The demand paging switching strategy used in the existing operating system can know the recently used pages by running multi-processing. Then, based on it, some page switching strategies have been made for the recently used pages or the frequently demanded pages. However, the strategies based on operating system cannot be applied in single processing that is not based on operating system because any context switching never occur on the single processing. So, this paper is trying to suggest the demand paging switching strategies that can be applied in paging loader running in single process. In the Return-Prediction-Algorithm, we saw the improved performance in the program that the function call occurred frequently in a long distance. And then, in the Most-Frequently-Used-Page-Remain-Algorithm, we saw the improved performance in the program that the references frequently occurred for the particular pages. Likewise, it had an enormous effect on keeping the memory reduction performance by the demand paging and reducing the running time delay at the same time.
Abstract
In this paper, we try to improve the performance of the demand paging loader suggested to use the demand paging way that is not based on operating system. The demand paging switching strategy used in the existing operating system can know the recently used pages by running multi-processing. Then, based on it, some page switching strategies have been made for the recently used pages or the frequently demanded pages. However, the strategies based on operating system cannot be applied in single processing that is not based on operating system because any context switching never occur on the single processing. So, this paper is trying to suggest the demand paging switching strategies that can be applied in paging loader running in single process. In the Return-Prediction-Algorithm, we saw the improved performance in the program that the function call occurred frequently in a long distance. And then, in the Most-Frequently-Used-Page-Remain-Algorithm, we saw the improved performance in the program that the references frequently occurred for the particular pages. Likewise, it had an enormous effect on keeping the memory reduction performance by the demand paging and reducing the running time delay at the same time.
참고문헌 (12)
- ARM Limited, "ARM DUI 0056D: ARM Developer Suite Developer Guide", ~ (2001)
- ARM Limited, "ARM DDI 0151C: ARM920T Technical Reference Manual", ~ (2001)
- C.Park, "A low-cost memory architecture with NAND XIP for mobile embedded systems", CODES+ISSS, 138~143 (2003)
- C.Park, "Compiler-assisted demand paging for embedded systems with flash memory", EMSOFT'04, 114~124 (2004)
- J.L.Smith, "Multiprogramming under a page on demand strategy", Comm.ACM, 10, pp.636~646 (1967)
- K. Kaspersky, "Code Optimization: Effective memory usage" (2003), A-List Publishing
- L.A.Belady, "A study of replacement algorithms for a virtual storage computer", IBM Systems Journal, 5(2), pp.78~101 (1996)
- Rik.van Riel, "Page replacement in Linux 2.4 memory management", USENIX Annual Technical Conference, pp.165~172 (2001)
- Samsung Electronics, "NAND Flash Memory and SmartMedia Data Book", ~ (2002)
- Y.S.Joo, "Energy and performance optimization of demand paging with oneNAND flash", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27(11), pp.1969~1982 (2008)
- 전현재, "ARM 프로세서에서 메모리 절감을 위한 요구페이징 기법의 구현", 대한임베디드공학회 추계학술대회, pp.47~50 (2010)
- 전찰규, "ARM 기반스스템에서 요구 페이징 기법의 성능 향상을 위한 알고리즘 연구", 대한임베디드공학회 추계학술대회, pp.51~54 (2010)