지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- Korean Institute of Information Scientists and Engineers Journal of Computing Science and Engineering Journal of Computing Science and Engineering Vol.8 No.3
- 발행연도
- 2014.9
- 수록면
- 157 - 172 (16page)
이용수
초록· 키워드
오류제보하기
Contemporary embedded systems often use NAND flash memory instead of hard disks as their swap space of virtual memory. Since the read/write characteristics of NAND flash memory are very different from those of hard disks, an efficient page replacement algorithm is needed for this environment. Our analysis shows that temporal locality is dominant in virtual memory references but that is not the case for write references, when the read and write references are monitored separately. Based on this observation, we present a new page replacement algorithm that uses different strategies for read and write operations in predicting the re-reference likelihood of pages. For read operations, only temporal locality is used; but for write operations, both write frequency and temporal locality are used. The algorithm logically partitions the memory space into read and write areas to keep track of their reference patterns precisely, and then dynamically adjusts their size based on their reference patterns and I/O costs. Without requiring any external parameter to tune, the proposed algorithm outperforms CLOCK, CAR, and CFLRU by 20%?66%. It also supports optimized implementations for virtual memory systems.
목차
Abstract
Ⅰ. INTRODUCTION
Ⅱ. RELATED WORK
Ⅲ. PAGE REFERENCES IN VIRTUAL MEMORY
Ⅳ. A NEW PAGE REPLACEMENT ALGORITHM
Ⅴ. PERFORMANCE EVALUATION
Ⅵ. REALIZATION IN REAL SYSTEM ARCHITECTURES
Ⅶ. CONCLUSIONS
REFERENCES
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2015-560-002699374