Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
About Us
ÀÌ¿ë¾È³»
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
Æ÷Ä¿½ºiN
¿¬±¸ÀÚ Á¤º¸
¶óÀÌ¡½ºÅ¸
ÆÄ¿öiNÅͺä
¼¼ÁßÇÑ
¿¬±¸ÀÚ·á
¹®ÀÚ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñÁ¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
´Ý±â
»çÀÌÆ®¸Ê
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
ÄÄÇ»ÅÍiN
¿¬±¸ÀÚ Á¤º¸
¿¬±¸ÀÚ·á
¹®ÀÚ DB
Ȧ·Î±×·¥ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñ Á¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
IT Daily
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
¼ºñ½º ¹Ù·Î°¡±â
¼³¹®Á¶»ç
¿¬±¸À±¸®
°ü·Ã±â°ü
Please wait....
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±¹³» ³í¹®Áö
Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö >
Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö
>
Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë
Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë
Current Result Document :
4
/ 4
ÀÌÀü°Ç
ÇѱÛÁ¦¸ñ(Korean Title)
ÄÚµå ½ºÄÉÁÙ¸µÀÇ È¿À²À» ³ôÀ̱â À§ÇÑ ·¹Áö½ºÅÍ ÇÒ´ç ¾Ë°í¸®Áò
¿µ¹®Á¦¸ñ(English Title)
A Register Allocation Algorithm to Improve Code Scheduling Efficiency
ÀúÀÚ(Author)
ÃÖÁرâ
ÀÌ»óÁ¤
Joon-Kee Choi
Sang-Jeong Lee
¿ø¹®¼ö·Ïó(Citation)
VOL 25 NO. 12 PP. 1825 ~ 1837 (1998. 12)
Çѱ۳»¿ë
(Korean Abstract)
¸í·É¾î ¼öÁØ º´·Äó¸®(ILP) ÇÁ·Î¼¼¼ ¼º´É Çâ»óÀ» À§ÇØ ÃÖÀûÈ ÄÄÆÄÀÏ·¯ÀÇ ¿ªÇÒÀÌ Áß¿äÇØÁö°í ÀÖ´Ù. ƯÈ÷, ¿©·¯ ÃÖÀûÈ ±â¹ý Áß ·¹Áö½ºÅÍ ÇÒ´ç°ú ÄÚµå ½ºÄÉÁÙ¸µÀº ILP ÇÁ·Î¼¼¼ÀÇ ¼º´É Çâ»ó¿¡ ÇʼöÀûÀÌ´Ù. ±×·¯³ª, À̵éÀº »óÃþµÇ´Â °ü°è¿¡ Àֱ⠶§¹®¿¡ ·¹Áö½ºÅÍ ÇÒ´ç°ú ÄÚµå ½ºÄÉÁÙ¸µÀ» ÀûÀýÈ÷ °í·ÁÇÏ¿© ¼³°èÇØ¾ß ÇÑ´Ù. º» ³í¹®¿¡¼´Â ·¹Áö½ºÅÍ ÇÒ´ç½Ã¿¡ ÄÚµå ½ºÄÉÁÙ¸µÀÇ È¿À²À» ³ôÀ̱â À§ÇÑ È®ÀåµÈ ·¹Áö½ºÅÍ ÇÒ´ç ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈµÈ ·¹Áö½ºÅÍ ÇÒ´ç ¾Ë°í¸®ÁòÀº ±âÁ¸ÀÇ ·¹Áö½ºÅÍ ÇÒ´ç ¾Ë°í¸®ÁòÀÌ ·¹Áö½ºÅÍ ÇÒ´ç ÈÄ À׿©ÀÇ ·¹Áö½ºÅÍ°¡ Á¸ÀçÇÒ °¡´É¼ºÀÌ ³ô±â ¶§¹®¿¡ ³²´Â ·¹Áö½ºÅÍ°¡ ¾øµµ·Ï ·¹Áö½ºÅ͸¦ ÇÒ´çÇÏ°í ³ôÀº ÄÚµå ½ºÄÉÁÙ¸µ °¡´É¼ºÀ» À§ÇÏ¿© ·¹Áö½ºÅÍ ÇÒ´ç½Ã ÀÚ·á Á¾¼Ó °ü°è¸¦ ÁÙÀδÙ. ½ÇÇè °á°ú Á¦¾ÈµÈ ·¹Áö½ºÅÍ ÇÒ´ç ¾Ë°í¸®ÁòÀÌ ±âÁ¸ÀÇ ·¹Áö½ºÅÍ ÇÒ´ç ¾Ë°í¸®Áò¿¡ ºñÇÏ¿© Æò±Õ 7£¥ÀÇ ¼º´É Çâ»ó°ú 73£¥ÀÇ º¹Àâµµ °³¼±À» º¸ÀÓÀ¸·Î½á Á¦¾ÈµÈ ¾Ë°í¸®ÁòÀÇ Å¸´ç¼ºÀ» °ËÁõÇÏ¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
As ILP processors have been developed, the importance for optimizing compiler is increased. Among various optimization methods, register allocation and code scheduling are essential to improve the performance of ILP processors. But it is required to consider carefully to apply these schemes to them because the results of one conflict with another. In this paper, we presented an extended register allocation algorithm which allocates registers to improve the effects of code scheduling. The conventional register allocation algorithm has possible to leave redundant registers after register allocation. The proposed register allocation algorithm allocates registers without redundant registers and decreases the data dependence relation to achieve a high code scheduling opportunity. Experimental results shown that the proposed register allocation algorithm was reduced the 7% execution clock cycles and the 73% complexity than the conventional scheme.
Å°¿öµå(Keyword)
ÆÄÀÏ÷ºÎ
PDF ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.