Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
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....
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±¹³» ³í¹®Áö
Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö >
Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö
>
Á¤º¸°úÇÐȸ ³í¹®Áö C : ÄÄÇ»ÆÃÀÇ ½ÇÁ¦
Á¤º¸°úÇÐȸ ³í¹®Áö C : ÄÄÇ»ÆÃÀÇ ½ÇÁ¦
Current Result Document :
5
/ 5
ÀÌÀü°Ç
ÇѱÛÁ¦¸ñ(Korean Title)
½º·¹µå µ¿±âÈ°¡ ¾ø´Â OpenMP µð·ºÆ¼ºê ÇÁ·Î±×·¥À» À§ÇÑ È¿À²ÀûÀÎ °æÇÕ°ËÁõ µµ±¸
¿µ¹®Á¦¸ñ(English Title)
An Efficient Tool for Verifying Races in OpenMP Directive Programs without Interthread Synchronization
ÀúÀÚ(Author)
ÇÏ¿Á±Õ
°¹®Çý
±è¿µÁÖ
Àü¿ë±â
OkKyoon Ha
MoonHye Kang
YoungJoo Kim
YongKi Jun
¿ø¹®¼ö·Ïó(Citation)
VOL 14 NO. 03 PP. 0301 ~ 0305 (2008. 05)
Çѱ۳»¿ë
(Korean Abstract)
OpenMP µð·ºÆ¼ºê ÇÁ·Î±×·¥¿¡¼ °æÇÕÀº ÀǵµÇÏÁö ¾ÊÀº ºñ°áÁ¤ÀûÀÎ ¼öÇà°á°ú¸¦ ÃÊ·¡ÇϹǷΠµð¹ö±ëÀ» À§Çؼ ¹Ýµå½Ã ŽÁöµÇ¾î¾ß ÇÑ´Ù. ÇÏÁö¸¸ ÀÌ·¯ÇÑ °æÇÕÀ» ŽÁöÇÏ´Â ±âÁ¸ÀÇ µµ±¸ÀÎ Intel Thread Checker´Â °æÇÕÀÇ Á¸À縦 °ËÁõÇÏÁö ¸øÇÏ¸ç °æÇÕÀ» ŽÁöÇÏ´Â ºñ¿ëÀÌ Å©¹Ç·Î ºñ½Ç¿ëÀûÀÌ´Ù. ÀÌ·¯ÇÑ ¹®Á¦¸¦ ÇØ°áÇϱâ À§Çؼ º» ¿¬±¸ÆÀÀº ÇÁ·Î±×·¥ÀÇ Æ¯¼º ¹× »ç¿ëÀÚ ¿ä±¸»çÇ×ÀÇ ºÐ¼®°á°ú¸¦ ÀÌ¿ëÇÏ¿© °æÇÕÀ» °ËÁõÇÏ´Â µµ±¸¸¦ °³¹ßÇÏ¿´À¸³ª ½º·¹µå µ¿±âÈ°¡ ¾ø´Â ¸ðµ¨¿¡¼´Â ÃÖÀûȵÇÁö ¸øÇÏ¿´´Ù. º» ³í¹®¿¡¼´Â ÀÌ·¯ÇÑ ¼±Ç࿬±¸ÀÇ °á°ú¸¦ È®ÀåÇϱâ À§Çؼ ½º·¹µå µ¿±âÈ°¡ ¾ø´Â ÇÁ·Î±×·¥ ¸ðµ¨À» À§ÇÑ È¿À²Àû ·¹ÀÌºí¸µ ±â¹ý°ú °æÇÕŽÁö ÇÁ·ÎÅäÄÝ ±â¹ýÀ» Àû¿ëÇÑ´Ù. ÇÕ¼ºÇÁ·Î±×·¥À» ÀÌ¿ëÇÏ¿© ½ÇÇèÇÑ °á°ú·Î´Â ½º·¹µå µ¿±âÈ°¡ ¾ø´Â ÇÁ·Î±×·¥ ¸ðµ¨¿¡¼ °æÇÕ°ËÁõ ½Ã°£ÀÌ ±âÁ¸ÀÇ µµ±¸º¸´Ù Æò±Õ 250¹è ÀÌ»ó ºü¸£°í, ÃÑ Á¢±Ù»ç°Ç ¼ö°¡ µ¿ÀÏÇϸé Ãִ뺴·Ä¼ºÀÌ Áõ°¡ÇÏ¿©µµ °æÇÕ°ËÁõ ½Ã°£ÀÌ °¨¼ÒÇÔÀ» º¸ÀδÙ.
¿µ¹®³»¿ë
(English Abstract)
Races must be detected for debugging OpenMP programs with directives, because they may cause unintended nondeterministic results of programs. Intel Thread Checker, an existing tool that can detects races, can not verify the existence of races and is often time-consuming and tends to require large space. To solve these problems, we developed a tool that verifies the existence of races using user requirements and analyzed model of programs. However, the tool does not have optimal performance in programs which have no synchronization for interthread coordination. This paper presents an optimal tool that applies the optimum labeling and protocol for program models without interthread coordination. For synthetic programs without interthread synchronization, the tool verifies races over 250 times faster than the previous tool on the average, even if the maximum parallelism increases in every case of which the number of total accesses are identical.
Å°¿öµå(Keyword)
OpenMP
µð¹ö±ë
°æÇÕ
°æÇÕŽÁö
OpenMP
Debugging
Race
Race Detection
ÆÄÀÏ÷ºÎ
PDF ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.