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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö > Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö A

Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö A

Current Result Document : 2 / 6 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) ±×¸®µå ½Ã½ºÅÛ¿¡¼­ Á¤ÀûÁ¤º¸¸¦ È°¿ëÇÑ ÀÛ¾÷Å¥ Áߺ¹ ½ºÄÉÁÙ¸µ ¾Ë°í¸®Áò
¿µ¹®Á¦¸ñ(English Title) A Workqueue Replication Scheduling Algorithm Using Static Information on Grid Systems
ÀúÀÚ(Author) °­¿ÀÇÑ   °­»ó¼º   ¼ÛÈñÇå   Ohhan Kang   Sangsung Kang   Heeheon Song  
¿ø¹®¼ö·Ïó(Citation) VOL 16-A NO. 01 PP. 0009 ~ 0016 (2009. 02)
Çѱ۳»¿ë
(Korean Abstract)
±×¸®µå ½Ã½ºÅÛÀº ³ÐÀº Áö¿ª¿¡ ºÐ»êµÇ¾î ÀÖ´Â ÀÌÁúÀûÀÎ ÀÚ¿øµé·Î ±¸¼ºµÇ¾î À־ °¡±î¿î Áö¿ª¿¡ ºñ±³Àû µ¿ÁúÀûÀÌ°í ÅëÁ¦°¡ °¡´ÉÇÑ ÀÚ¿øµéÀ» ´ë»óÀ¸·Î ÇÏ´Â ÀüÅëÀû º´·Ä½Ã½ºÅÛÀÇ ½ºÄÉÁÙ¸µ ¾Ë°í¸®ÁòÀ¸·Î´Â È¿À²ÀûÀÎ ÀÛ¾÷󸮰¡ ºÒ°¡´ÉÇÏ´Ù. º» ³í¹®¿¡¼­´Â ±×¸®µå ½Ã½ºÅÛÀÇ Æ¯¼ºÀ» ¹Ý¿µÇÑ ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇϱâ À§ÇØ ±âÁ¸ÀÇ ½ºÄÉÁÙ¸µ ¾Ë°í¸®Áò¿¡¼­ »ç¿ëÇÏ°í ÀÖ´Â Á¤º¸ÀÇ Á¾·ù¿¡ ÃÊÁ¡À» µÎ°í ¼±Ç࿬±¸¿¡¼­ Á¦¾ÈµÈ ¾Ë°í¸®ÁòµéÀ» ºñ±³ ºÐ¼®ÇÏ¿© °³¼±ÇÒ ¼ö ÀÖ´Â ¿ä¼ÒµéÀ» µµÃâÇÏ¿´´Ù. ¾Ë°í¸®ÁòµéÀ» ºñ±³ ºÐ¼®ÇÑ °á°ú ÇÁ·Î¼¼¼­ÀÇ ¼ö³ª ¼º´É°ú °°Àº ÀÚ¿øÀÇ Á¤Àû Á¤º¸°¡ ½ºÄÉÁÙ¸µ ¾Ë°í¸®Áò¿¡ À¯¿ëÇÏ°Ô »ç¿ëµÉ ¼ö ÀÖÀ¸¸ç, 󸮼ӵµ°¡ ±Ø´ÜÀûÀ¸·Î ´À¸®°Å³ª »ç¿ëÀÌ ºÒ°¡´ÉÇÑ ÀÚ¿øÀ» ȸÇÇÇϱâ À§ÇÑ ¼ö´ÜÀÌ ÇÊ¿äÇÏ°í, ºñ±³Àû Àå½Ã°£ 󸮸¦ ÇÏ´Â ±×¸®µåÀÇ Æ¯¼º»ó ÀÚ¿øÀÇ ½Ç½Ã°£ ºÎÇÏÁ¤º¸¸¦ ÀÌ¿ëÇÏ´Â °æ¿ì È¿¿ë¼ºÀÌ ¶³¾îÁö´Â °ÍÀ» È®ÀÎÇÒ ¼ö ÀÖ¾ú´Ù. º» ³í¹®¿¡¼­´Â ÀÌ·¯ÇÑ ºÐ¼® °á°ú¸¦ ¹ÙÅÁÀ¸·Î WQR(Workqueue Replication) ¾Ë°í¸®ÁòÀÇ ³í¸®¿¡ Á¤Àû ÀÚ¿øÁ¤º¸¸¦ °í·ÁÇϵµ·Ï °³¼±ÇÑ »õ·Î¿î ¾Ë°í¸®Áò(WQRuSI)À» Á¦¾ÈÇÏ¿´À¸¸ç, ½Ã¹Ä·¹À̼ÇÀ» ÅëÇÏ¿© »õ·Î¿î ¾Ë°í¸®ÁòÀÇ ¼º´ÉÀÌ ¿ì¼öÇÔÀ» È®ÀÎÇÏ¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
Because Grid system consists of heterogenous computing resources, which are distributed on a wide scale, it is impossible to efficiently execute applications with scheduling algorithms of a conventional parallel system that, in contrast, aim at homogeneous and controllable resources. To suggest an algorithm that can fully reflect the characteristics of a grid system, our research is focused on examining the type of information used in current scheduling algorithms and consequently, deriving factors that could develop algorithms further. The results from the analysis of these algorithms not only show that static information of resources such as capacity or the number of processors can facilitate the scheduling algorithms but also verified a decrease in efficiency in case of utilizing real time load information of resources due to the intrinsic characteristics of a grid system relatively long computing time, and the need for the means to evade unfeasible resources or ones with slow processing time. In this paper, we propose a new algorithm, which is revised to reflect static information in the logic of WQR (Workqueue Replication) algorithms and show that it provides better performance than the one used in the existing method through simulation.
Å°¿öµå(Keyword) ±×¸®µå   ½ºÄÉÁÙ¸µ   Á¤Àû Á¤º¸   ÀÛ¾÷Å¥ Áߺ¹   Grid   Scheduling   Static Information   Workqueue Replication  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå