Thông tin chung
  English
  Đề tài NC khoa học
  Bài báo, báo cáo khoa học
  Hướng dẫn Sau đại học
  Sách và giáo trình
  Các học phần và môn giảng dạy
  Giải thưởng khoa học, Phát minh, sáng chế
  Khen thưởng
  Thông tin khác
  Tài liệu tham khảo
  Hiệu chỉnh
 
Số người truy cập: 107,413,935

 Time-based CFLRU: A Novel Cache Replacement Algorithm for Flash Memory
Tác giả hoặc Nhóm tác giả: Thien-Binh Dang; Ahn, Hyohoon; Lee, Jisoo; Jung, Jinwoong; Choo, Hyunseung
Nơi đăng: Proceedings of the International Conference on Embedded Systems, Cyber-physical Systems, and Applications (ESCS); Athens, (2018).; Số: 1;Từ->đến trang: 88-94;Năm: 2018
Lĩnh vực: Công nghệ thông tin; Loại: Báo cáo; Thể loại: Quốc tế
TÓM TẮT
Recently, flash memory makes a tendency to replace magnetic disk for the secondary storage of mobile devices. Therefore, it is necessary to re-investigate various operating system polices such as cache replacement policy to optimize them for flash memory-based storage. Operating systems with flash memory need to consider the number of write operations instead of only cache hit rate. In this paper, we propose a new cache replacement policy, called Time-based Clean First Least Recently Used (TB CFLRU) using 5-minute rule. TB CFLRU applies the idea of 5-minute rule where pages referenced every five minutes should be memory resident. In performance evaluation, we compare TB CFLRU with two well-known cache replacement algorithms: Least Recently Used (LRU) and Clean First Least Recently Used (CFLRU). Experiment result shows that the proposed cache replacement algorithm has lower page miss cost and page write cost comparing to LRU and CFLRU
ABSTRACT
Recently, flash memory makes a tendency to replace magnetic disk for the secondary storage of mobile devices. Therefore, it is necessary to re-investigate various operating system polices such as cache replacement policy to optimize them for flash memory-based storage. Operating systems with flash memory need to consider the number of write operations instead of only cache hit rate. In this paper, we propose a new cache replacement policy, called Time-based Clean First Least Recently Used (TB CFLRU) using 5-minute rule. TB CFLRU applies the idea of 5-minute rule where pages referenced every five minutes should be memory resident. In performance evaluation, we compare TB CFLRU with two well-known cache replacement algorithms: Least Recently Used (LRU) and Clean First Least Recently Used (CFLRU). Experiment result shows that the proposed cache replacement algorithm has lower page miss cost and page write cost comparing to LRU and CFLRU
© Đại học Đà Nẵng
 
 
Địa chỉ: 41 Lê Duẩn Thành phố Đà Nẵng
Điện thoại: (84) 0236 3822 041 ; Email: dhdn@ac.udn.vn