• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)

Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) L2LRU: LRU ÆäÀÌÁö ±³Ã¼ ±â¹ýÀ» À§ÇÑ ·¯´× ±â¹Ý ÆäÀÌÁö À̵¿ Á¤Ã¥
¿µ¹®Á¦¸ñ(English Title) L2LRU: Learning-based Page Movement Policy for LRU Page Replacement Policy
ÀúÀÚ(Author) Á¶¹Î¼±   °­µ¿Çö   Minseon Cho   Donghyun Kang  
¿ø¹®¼ö·Ïó(Citation) VOL 48 NO. 09 PP. 0981 ~ 0987 (2021. 09)
Çѱ۳»¿ë
(Korean Abstract)
ÆäÀÌÁö ij½Ã ±³Ã¼ Á¤Ã¥ Áß ÇϳªÀÎ LRU´Â ÀçÁ¢±ÙÀÌ ¹ß»ýÇÏ´Â ÆäÀÌÁö¸¦ ¸®½ºÆ®ÀÇ ¾Õ(Head) À§Ä¡·Î À̵¿½ÃÅ´À¸·Î½á ij½Ã ÀûÁß·üÀ» ³ôÀδÙ. ±×·¯³ª, LRUÀÇ ÆäÀÌÁö À̵¿Àº ¶ô-¾ð¶ô ¸í·É¾î¸¦ È£ÃâÇÔÀ¸·Î½á ½Ã½ºÅÛÀÇ ´ë±â »óŸ¦ À¯¹ßÇÑ´Ù. ÀÌ¿¡, º» ³í¹®¿¡¼­´Â µö ·¯´×À» ÀÌ¿ëÇÏ¿© ÆäÀÌÁöÀÇ ÀçÁ¢±Ù °Å¸®¸¦ ÇнÀÇÏ°í ÀçÁ¢±ÙÀÌ ¹ß»ýÇÏ´Â °æ¿ì, LRU ¸®½ºÆ® ÆäÀÌÁö¿¡ ´ëÇÑ À̵¿ À¯¹«¸¦ ÆÇ´ÜÇÏ´Â L2LRU(Learning-based Lock-free LRU) ±â¹ýÀ» »õ·Ó°Ô Á¦¾ÈÇÑ´Ù. ƯÈ÷, L2LRU´Â ±âÁ¸ LRU ±³Ã¼ ±â¹ý°ú ´Ù¸£°Ô ÆäÀÌÁö¸¦ ÀçÁ¢±Ù µÉ °¡´É¼ºÀÌ ³ôÀº À§Ä¡·Î ÆäÀÌÁö¸¦ À̵¿½ÃŲ´Ù. Á¦¾È ±â¹ýÀ» Æò°¡Çϱâ À§ÇØ, ¿ì¸®´Â Æ®·¹À̽º ±â¹Ý ½Ã¹Ä·¹ÀÌ¼Ç ¹æ½ÄÀ¸·Î L2LRUÀ» ±¸ÇöÇÏ¿´À¸¸ç, Microsoft Research Cambridge TraceÀ» ½ÇÇèÀÇ ÀÔ·ÂÀ¸·Î »ç¿ëÇÏ¿´´Ù. ½ÇÇè °á°ú Á¦¾ÈÇÑ L2LRU°¡ LRU ´ëºñ ÃÖ´ë 91% ¶ô-¾ð¶ô ¸í·É¾î È£ÃâÀ» °¨¼Ò½Ãų ¼ö ÀÖ¾ú´Ù.
¿µ¹®³»¿ë
(English Abstract)
The LRU (least-recently used) page replacement policy has been designed to enhance the cache hit ratio by moving the page that is repeatedly accessed on the cache, to the head of the list. However, the LRU policy sometimes incurs a situation of system stall (or wait) because it requires lock-unlock commands to move each page. In this paper, we propose a new page replacement policy, called L2LRU(Learning-based Lock-free LRU), that determines whether to move or not a page by learning the reuse distance of the page with deep-learning techniques. Unlike LRU, L2LRU moves the page to the position with a high possibility of access in the near future. For evaluation, we implemented L2LRU based on trace-driven simulation and used Microsoft Research Cambridge Trace as the input of the simulation. The results clearly confirmed that L2LRU reduced the number of lock-unlock commands by up to 91% compared to the traditional LRU policy.
Å°¿öµå(Keyword) ij½Ã ±³Ã¼ Á¤Ã¥   ´ÙÃþ ÆÛ¼ÁÆ®·Ð   ¶ô-¾ð¶ô   LRU   cache replacement policy   multi-layer perceptron   lock-unlock   LRU  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå