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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö (KIISE Transactions on Computing Practices)

Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö (KIISE Transactions on Computing Practices)

Current Result Document : 8 / 10 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) ºÐ»ê ÀÎ-¸Þ¸ð¸® ȯ°æ¿¡¼­ ºÎÇÏ ºÐ»êÀ» À§ÇÑ µ¥ÀÌÅÍ º¹Á¦¿Í ÀÌÁÖ ±â¹ý
¿µ¹®Á¦¸ñ(English Title) Data Replication and Migration Scheme for Load Balancing in Distributed Memory Environments
ÀúÀÚ(Author) ÃÖ±âÅ   À±»ó¿ø   ¹ÚÀç¿­   ÀÓÁ¾Å   º¹°æ¼ö   À¯Àç¼ö   Kitae Choi   Sangwon Yoon   Jaeyeol Park   Jongtae Lim   Kyoungsoo Bok   Jaesoo Yoo  
¿ø¹®¼ö·Ïó(Citation) VOL 22 NO. 01 PP. 0044 ~ 0049 (2016. 01)
Çѱ۳»¿ë
(Korean Abstract)
ÃÖ±Ù ¼Ò¼È ¹Ìµð¾îÀÇ ¼ºÀå°ú µðÁöÅÐ ±â±âÀÇ È°¿ëÀÌ Áõ°¡ÇÔ¿¡ µû¶ó µ¥ÀÌÅÍ°¡ ±âÇϱ޼öÀûÀ¸·Î ±ÞÁõÇÏ°í ÀÖ´Ù. ÀÌ·¯ÇÑ ´ë¿ë·®ÀÇ µ¥ÀÌÅ͸¦ È¿À²ÀûÀ¸·Î ó¸®Çϱâ À§ÇØ ºÐ»ê ¸Þ¸ð¸® ó¸® ½Ã½ºÅÛÀ» »ç¿ëÇÑ´Ù. ÇÏÁö¸¸ ºÐ»ê ȯ°æ¿¡¼­ ƯÁ¤ ³ëµå¿¡ ºÎÇÏ°¡ ÁýÁßÀÌ µÇ¸é ³ëµåÀÇ ¼º´ÉÀÌ ÀúÇϵǴ ¹®Á¦°¡ ¹ß»ýÇÑ´Ù. º» ³í¹®Àº ºÐ»ê ¸Þ¸ð¸® ȯ°æ¿¡¼­ ³ëµåÀÇ ºÎÇϸ¦ ÀûÀýÇÏ°Ô ºÐ¹èÇÏ´Â ºÎÇÏ ºÐ»ê ±â¹ýÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈÇÏ´Â ±â¹ýÀº ³ëµåÀÇ ºÎÇϸ¦ °ü¸®Çϱâ À§ÇØ ÇÖ µ¥ÀÌÅ͸¦ ¿©·¯ ³ëµå¿¡ º¹Á¦ÇÏ°í ³ëµå°¡ Ãß°¡µÇ°Å³ª »èÁ¦µÉ ¶§ ³ëµåÀÇ ºÎÇϸ¦ °í·ÁÇÏ¿© µ¥ÀÌÅ͸¦ ÀÌÁÖ½ÃŲ´Ù. Ŭ¶óÀ̾ðÆ®´Â ÇÖ µ¥ÀÌÅÍÀÇ ¸ÞŸµ¥ÀÌÅÍ Á¤º¸¸¦ À¯ÁöÇÏ¿© Á÷Á¢ ³ëµå¿¡ Á¢±ÙÇÔÀ¸·Î½á Áß¾Ó ¼­¹öÀÇ Á¢±ÙÀ» °¨¼Ò½ÃŲ´Ù. ¼º´É Æò°¡¸¦ ÅëÇØ Á¦¾ÈÇÏ´Â ºÎÇÏ ºÐ»ê °ü¸® ±â¹ýÀÌ ±âÁ¸¿¡ ij½Ã °ü¸® ±â¹ý¿¡ ºñÇØ ¿ì¼öÇÔÀ» ÀÔÁõÇÑ´Ù.
¿µ¹®³»¿ë
(English Abstract)
Recently, data has been growing dramatically along with the growth of social media and digital devices. A distributed memory processing system has been used to efficiently process large amounts of data. However, if a load is concentrated in a certain node in distributed environments, a node performance significantly degrades. In this paper, we propose a load balancing scheme to distribute load in a distributed memory environment. The proposed scheme replicates hot data to multiple nodes for managing a node¡¯s load and migrates the data by considering the load of the nodes when nodes are added or removed. The client reduces the number of accesses to the central server by directly accessing the data node through the metadata information of the hot data. In order to show the superiority of the proposed scheme, we compare it with the existing load balancing scheme through performance evaluation.
Å°¿öµå(Keyword) ºÐ»ê ¸Þ¸ð¸® ȯ°æ   ij½Ã °ü¸®   ÇÖ µ¥ÀÌÅÍ   ºÎÇÏ ºÐ»ê   distributed memory environment   cache management   ot data   load balancing  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå