ÇѱÛÁ¦¸ñ(Korean Title) |
N-Â÷¿ø ¸Þ½¬ ³×Æ®¿öÅ©¿¡¼ÀÇ ºÎºÐÀû ÀûÀÀ¼ºÀ» ÀÌ¿ëÇÑ Deadlock-Free °áÇÔÆ÷¿ë ¶ó¿ìÆà ±â¹ý |
¿µ¹®Á¦¸ñ(English Title) |
A Deadlock-Free Fault-Tolerant Routing Method Using Partial-Adaptiveness in a N-Dimensional Meshed Network |
ÀúÀÚ(Author) |
¹®´ë±Ù
±èÇйè
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 06 NO. 04 PP. 1090 ~ 1097 (1999. 04) |
Çѱ۳»¿ë (Korean Abstract) |
¿¾ÇÇÑ È¯°æ¿¡¼ µ¿À۵Ǵ ¸ÖƼÄÄÇ»ÅÍ´Â ¿ä¼Ò°áÇÔ(component faults)ÀÌ Á¸ÀçÇÏ´Â »óȲ¿¡¼µµ Á¤»óÀû µ¿ÀÛÀ» º¸ÀåÇÒ ¼ö ÀÖµµ·Ï ¼³°èµÇ¾î¾ß ÇÑ´Ù. À̸¦ À§ÇÑ ÇϳªÀÇ ¹æ¹ýÀ¸·Î °áÇÔÆ÷¿ë ¶ó¿ìÆÃ(fault-tolerant routing) ±â¹ýÀÌ °í·ÁµÉ ¼ö ÀÖ´Ù. º» ³í¹®¿¡¼´Â n-Â÷¿ø ¸Þ½¬ ³×Æ®¿öÅ©¸¦ ±âº» ÅäÆú·ÎÁö·Î ¼±ÅÃÇÏ¿© ÀÌ·¯ÇÑ ³×Æ®¿öÅ©ÀÇ ÀÓÀÇÀÇ Àå¼Ò¿¡¼ ¸µÅ©°áÇÔÀÌ ¹ß»ýÇØÀ» °æ¿ì¿¡µµ ¸Þ½ÃÁöµéÀ» ¸ñÀûÁö·Î Àü´Þ½Ãų ¼ö ÀÖ´Â °áÇÔÆ÷¿ë ¶ó¿ìÆà ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈµÈ °áÇÔÆ÷¿ë ¶ó¿ìÆà ¾Ë°í¸®ÁòÀº ±âº»ÀûÀ¸·Î WH(WormHole) ¶ó¿ìÆà ¹æ½ÄÀ» äÅÃÇϸç, deadlock-free¸¦ ½ÇÇöÇϱâ À§ÇÏ¿© ÇÑ °³ÀÇ ¹°¸®Àû ä³ÎÀ» °øÀ¯ÇÏ´Â º¹¼ö °³ÀÇ °¡»óä³Îµé(virtual channels)À» »ç¿ëÇÑ´Ù. °á·ÐÀûÀ¸·Î ÄÄÇ»ÅÍ ½Ã¹Ä·¹À̼ÇÀ» ÅëÇØ Á¦¾ÈµÈ ¾Ë°í¸®ÁòÀÌ ³Î¸® ¾Ë·ÁÁø X-Y ¶ó¿ìÆà ¾Ë°í¸®Áòº¸´Ù Çâ»óµÈ ¼º´ÉÀ» °®´Â´Ù´Â »ç½ÇÀ» ÀÔÁõÇÑ´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
The multicomputers operated in harsh environments should be designed to guarantee normal operations in the presence of the component faults. One solution for this is a fault-tolerant routing. In this paper, we consider n-dimensional meshed network for the basic topology and proposed a simple fault-tolerant routing algorithm that can transfer messages to their destination as desired in the presence of some component faults. The built algorithm basically adopts a WormHole(WH) routing method and uses the virtual channels sharing a physical channel for deadlock-freedom. Consequently, we show that the suggested algorithm has a higher performance than the X-Y routing algorithm through simulation results. , , |
Å°¿öµå(Keyword) |
component faults
fault-tolerant routing
virtual channels
WormHole
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|