Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
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....
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±¹³» ³í¹®Áö
Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö >
Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö
>
Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö (KIISE Transactions on Computing Practices)
Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö (KIISE Transactions on Computing Practices)
Current Result Document :
1
/ 2
´ÙÀ½°Ç
ÇѱÛÁ¦¸ñ(Korean Title)
T-CAS : ¿øÀÚÀû Compare & SwapÀ» Áö¿øÇÏÁö ¾Ê´Â °øÀ¯ ¸Þ¸ð¸® ½Ã½ºÅÛÀÇ Å¸ÀÌ¸Ó ±â¹Ý µ¿½Ã¼º Á¦¾î ¹æ¾È
¿µ¹®Á¦¸ñ(English Title)
T-CAS : A Method of Timer-based Controlling Concurrency of Shared Memory Systems that do not support Atomic Compare & Swap
ÀúÀÚ(Author)
½ÅÀç±Ç
ÃÖ¿ë¼®
¾È½Å¿µ
ÀÌ»ó±æ
±èÁ¤¿
±èÁØÇü
Á¶°æ¿¬
ÀÌöÈÆ
Jaekwon Shin
Yongseok Choi
Shinyoung Ahn
Sanggil Lee
Jeongyeol Kim
Junhyoung Kim
Kyeongyeon Cho
Cheolhoon Lee
¿ø¹®¼ö·Ïó(Citation)
VOL 28 NO. 05 PP. 0267 ~ 0277 (2022. 05)
Çѱ۳»¿ë
(Korean Abstract)
µ¿½Ã¼º Á¦¾î´Â ÇϳªÀÇ ¸Þ¸ð¸®¿¡ 2°³ ÀÌ»óÀÇ °³Ã¼°¡ Á¢±ÙÇÒ ¶§ Race ConditionÀ» ¹æÁöÇϱâ À§ÇÏ¿© »ç¿ëÇÏ´Â ¹æ½ÄÀÌ´Ù. ¹°¸®ÀûÀ¸·Î ºÐ¸®µÈ ´ÙÁß ³ëµå°¡ °øÀ¯ ¸Þ¸ð¸®¿¡ Á¢±ÙÇÒ ¶§ Race ConditionÀ» ¹æÁöÇϱâ À§ÇÏ¿© ±âÁ¸¿¡´Â Transactional Memory ȤÀº ¸¶½ºÅÍ ³ëµåÀÇ Á¦¾î ¹æ½ÄÀ» »ç¿ëÇÏ¿´´Ù. ÇÏÁö¸¸ ÀÌ·¯ÇÑ Áß¾Ó Á¦¾î ¹æ½ÄÀº °øÀ¯ ¸Þ¸ð¸®¿¡ ´ëÇÑ Á¢±Ù ¼Óµµ°¡ ´À¸®°í, ½Ã½ºÅÛÀÇ ¿À¹öÇìµå°¡ ½ÉÇÑ ´ÜÁ¡ÀÌ ÀÖ´Ù. µû¶ó¼, º» ³í¹®¿¡¼´Â Áß¾Ó Á¦¾î ¾øÀÌ °øÀ¯ ¸Þ¸ð¸®¿¡ °í¼ÓÀ¸·Î Á¢±ÙÇϴ ȯ°æ¿¡¼ ÄÄÇ»Æà ÀÚ¿øµéÀÌ °øÀ¯¸Þ¸ð¸®¿¡ »óÈ£ ¹èŸÀûÀ¸·Î Á¢±ÙÇÒ ¼ö ÀÖ´Â ¾Ë°í¸®ÁòÀ» Á¦½ÃÇÏ¿´À¸¸ç, ½ÃÇèÀ» ÅëÇÏ¿© °øÀ¯ ¸Þ¸ð¸® µ¥ÀÌÅÍÀÇ ¿øÀÚ¼ºÀ» º¸ÀåÇÒ ¼ö ÀÖÀ½À» Áõ¸íÇÏ¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
Concurrency control is a method used to prevent the Race Condition when two or more objects access a memory. To prevent the Race Condition when multiple physically isolated nodes access shared memory, we have previously used Transactional Memory or master node control methods. However, these approaches have disadvantages, such as slow access to shared memory and heavy system overhead. Therefore, in this paper, we present an algorithm that allows mutually exclusive access to shared memory among computing resources in environments where shared memory is accessed at high speed without central control, and it demonstrates that testing can guarantee the atomicity of shared memory data.
Å°¿öµå(Keyword)
ÆÄÀÏ÷ºÎ
PDF ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.