Memory Hierarchy Management

Research on memory hierarchy management at the Memory & Storage Architecture Lab. focuses on efficient management of buffer caches (also called by various names such as disk cache, file cache, etc.) that are present in the operating system and disk controllers. We have proposed a new replacement algorithm called the LRFU (Least Recently/Frequently Used) replacement algorithm that subsumes not only the well-known LRU and LFU algorithms but also their implementations. We also have proposed a detection-based replacement algorithm called DEAR that automatically detects the block reference pattern of applications and uses an appropriate replacement algorithm depending on the detection result. Work in this area draws heavily from the operating system and computer architecture fields.

Selected Publications

  1. Jongmoo Choi, Sam H. Noh, Sang Lyul Min, Eun-Yong Ha, and Yookun Cho, "Design, Implementation, and Performance Evaluation of a Detection-Based Adaptive Block Replacement Scheme," IEEE Transactions on Computers, vol. 51, no. 7, pp. 793-800, July 2002.
  2. Hyokyung Bahn, Kern Koh, Sam H. Noh, and Sang Lyul Min, "Efficient Cache Replacement for Non-uniform Objects in Web Caches," IEEE Computer, vol. 35, no. 6, pp. 65-73, June 2002.
  3. Donghee Lee, Jongmoo Choi, Jong-Hun Kim, Sam H. Noh, Sang Lyul Min, Yookun Cho, and Chong Sang Kim, "LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies," IEEE Transactions on Computers, vol. 50, no. 12, pp. 1352-1361, Dec. 2001.
  4. Kunsoo Park, Sang Lyul Min, and Yookun Cho, "The working set algorithm has competitive ratio less than two," Information Processing Letters, vol. 63, no. 4, pp. 183-188, Sep. 1997