Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë
Current Result Document : 7 / 7
ÇѱÛÁ¦¸ñ(Korean Title) |
±×·¡ÇÁ Ãà¾à ±â°è¿¡¼ ¼öÇà ½Ã°£À» °í·ÁÇÑ ·çÆ® ÃÖÀûÈ ¹æ¹ý |
¿µ¹®Á¦¸ñ(English Title) |
Root Optimization with Less Execution-Time Overhead in Graph Reduction Machine |
ÀúÀÚ(Author) |
ÃÖ±¤ÈÆ
ÇÑż÷
Kwanghoon Choi
Taisook Han
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 25 NO. 05 PP. 0841 ~ 0853 (1998. 05) |
Çѱ۳»¿ë (Korean Abstract) |
Áö¿¬ °è»ê ±â¹Ý ÇÔ¼öÇü ¾ð¾î¿¡¼ µ¿ÀÏÇÑ °ªÀ» °®´Â ¸Å°³º¯¼ö¸¦ °¡Áö°í Àç±ÍÈ£ÃâÀÌ ÀϾ ¶§ ÀϺΠµ¿ÀÏÇÑ ³»¿ëÀ» °®´Â ½éÅ©¸¦ ¹Ýº¹Çؼ ¸¸µå´Â ºÎ´ãÀÌ ÀÖ´Ù. M,P.Jones´Â G-machine¿¡ °øÀ¯ÇÒ ½éÅ©¸¦ ã´Â ¸í·É¾î¸¦ µµÀÔÇÏ¿© ÀÌ ºÎ´ãÀ» ÁÙÀÌ´Â ·çÆ® ÃÖÀûÈ ¹æ¹ýÀ» Á¦¾ÈÇß´Ù. ÀÌ ¹æ¹ýÀ¸·Î ½éÅ© °øÀ¯¸¦ ÅëÇØ ¼öÇà °ø°£À» Àý¾àÇÒ ¼ö ÀÖ¾úÁö¸¸ °øÀ¯ÇÒ ½éÅ©ÀÇ À§Ä¡¸¦ ã´Âµ¥ ½Ã°£ ºÎ´ãÀÌ Å©´Ù. ±×¸®°í ÀÓÀÇÀÇ ½éÅ©¸¦ ºí·°ÇüÅ·ΠǥÇöÇÒ ¼ö ¾ø°í Å×ÀÏ È£ÃâÀ» ÇÔ²² Àû¿ëÇÒ ¼ö ¾ø´Â ´ÜÁ¡ÀÌ ÀÖ´Ù. ÀÌ·¯ÇÑ ÀÌÀ¯·Î ÀÎÇØ ÀÌ ¹æ¹ýÀ» ½ÇÁ¦ÀûÀÎ ÄÄÆÄÀÏ·¯¿¡ Àû¿ëÇϱⰡ ½±Áö ¾Ê¾Ò´Ù. º» ³í¹®¿¡¼´Â, ¾ÈÀüÇÏ°Ô ¾ÅÅ©¸¦ °øÀ¯ÇÒ ¼ö ÀÖ´Â ÇÔ¼ö·Î º¯È¯ÇÏ°í »õ·Î¿î ŸÀÔÀÇ ³ëµå¿Í ÀÌ ³ëµå¿¡ ´ëÇÑ ·±Å¸ÀÓ ½Ã½ºÅÛ ·çƾÀ» Ãß°¡ÇØ ±âÁ¸ÀÇ ¹æ¹ýÀÌ Áö´Ñ ´ÜÁ¡À» ÇØ°áÇÏ¿´´Ù. ±×¸®°í º» ³í¹®¿¡¼ Á¦¾ÈÇÑ ¹æ¹ýÀ» Chalmers Haskell ÄÄÆÄÀÏ·¯¿¡ ±¸ÇöÇØ ½ÇÇö °¡´É¼ºÀ» º¸¿´°í, º¥Ä¡¸¶Å· ½ÇÇè °á°ú¸¦ ÅëÇØ ÀûÀº ¼öÇà ½Ã°£ ºÎ´ãÀ¸·Î ¼öÇà °ø°£À» ÁÙÀÏ ¼ö ÀÖÀ½À» È®ÀÎÇÏ¿´´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
In functional languages based on lazy evaluation, recursive calls with same-valued parameters can create thunks containing invariants repeatedly. M.P.jones introduced a new G-machine instruction to find sharable invariants in thunks so that those overhead could be reduced. It is called root optimization. Although root optimization can reduce runtime space, it results time overhead to search sharable positions of thunks. Also, it prevents from thunks representations with blocks and tail call optimizations. These cause difficulties in employing root optimization for practical compilers. We solved the problems by transforming a function into one which can share invariants of thunks safely and introducing new types of node and runtime system routines for each type. We implemented the idea on Chalmers Haskell compiler to show its realizability. We convinced that root optimization can be implemented with less execution-time overhead by experiment results. |
Å°¿öµå(Keyword) |
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|