Fault-Tolerant Adaptive Deadlock-Recovery Routing for k-ary n-cube Networks
This paper proposes a fault-tolerant fully adaptive deadlock-recovery routing algorithm for k-ary n-cube networks. We intend to consider both the adaptability for faults and the communication performance by integrating regular and irregular network routing. Our algorithm tolerates any number or shap...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 58 |
|---|---|
| container_issue | |
| container_start_page | 49 |
| container_title | |
| container_volume | |
| creator | Yoshinaga, T. Hosogoshi, H. Sowa, M. |
| description | This paper proposes a fault-tolerant fully adaptive deadlock-recovery routing algorithm for k-ary n-cube networks. We intend to consider both the adaptability for faults and the communication performance by integrating regular and irregular network routing. Our algorithm tolerates any number or shape of faults without disabling fault-free nodes by maintaining routing tables that are configured based on faulty information. Our algorithm also provides minimal misrouting paths around faults by guaranteeing deadlock freedom using only two virtual channels per physical channel. Simulation results show that the proposed algorithm attains robust communication performance for uniform and nonuniform traffic patterns not only on a fault-free torus network but also on irregular tori with faulty nodes |
| doi_str_mv | 10.1109/IWIA.2004.10016 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1410680</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1410680</ieee_id><sourcerecordid>1410680</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-9ade3a5d4ef1391fd0697b313c045c1de141dcc3271286e22ee1422376958e363</originalsourceid><addsrcrecordid>eNotT01Lw0AUXPwAQ83Zg5f8gY3v7W42yTFUW4NFoVQ8lu3ui8TEpOSj4r93RecyMMMMM4zdIMSIkN-Vb2URCwAVIwDqMxYIrQRXiNk5C_M0g1TniRCQwAULMJEpl0LIKxaO4wd4SO8qDNjTysztxHd9S4Pppqhw5jjVJ4ruybi2tw3fku1PNHxH236e6u49qvoharjxSsftfKDomaavfmjGa3ZZmXak8J8X7HX1sFs-8s3LulwWG15jmkw8N46kSZyiCmWOlQOdpweJ0oJKLDpChc5aKVIUmSYhyCt-_O-jjKSWC3b711sT0f441J9-zN6nQGcgfwCg606D</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Fault-Tolerant Adaptive Deadlock-Recovery Routing for k-ary n-cube Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Yoshinaga, T. ; Hosogoshi, H. ; Sowa, M.</creator><creatorcontrib>Yoshinaga, T. ; Hosogoshi, H. ; Sowa, M.</creatorcontrib><description>This paper proposes a fault-tolerant fully adaptive deadlock-recovery routing algorithm for k-ary n-cube networks. We intend to consider both the adaptability for faults and the communication performance by integrating regular and irregular network routing. Our algorithm tolerates any number or shape of faults without disabling fault-free nodes by maintaining routing tables that are configured based on faulty information. Our algorithm also provides minimal misrouting paths around faults by guaranteeing deadlock freedom using only two virtual channels per physical channel. Simulation results show that the proposed algorithm attains robust communication performance for uniform and nonuniform traffic patterns not only on a fault-free torus network but also on irregular tori with faulty nodes</description><identifier>ISSN: 1537-3223</identifier><identifier>ISBN: 9780769522050</identifier><identifier>ISBN: 076952205X</identifier><identifier>EISSN: 2642-4118</identifier><identifier>DOI: 10.1109/IWIA.2004.10016</identifier><language>eng</language><publisher>IEEE</publisher><subject>adaptive router ; deadlock recovery ; Fault tolerance ; Fault tolerant systems ; k-ary n-cube ; non-minimal routing algorithm ; Routing ; System recovery</subject><ispartof>Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04), 2004, p.49-58</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1410680$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>310,311,781,785,790,791,2059,4051,4052,27930,54925</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1410680$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yoshinaga, T.</creatorcontrib><creatorcontrib>Hosogoshi, H.</creatorcontrib><creatorcontrib>Sowa, M.</creatorcontrib><title>Fault-Tolerant Adaptive Deadlock-Recovery Routing for k-ary n-cube Networks</title><title>Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)</title><addtitle>IWIA</addtitle><description>This paper proposes a fault-tolerant fully adaptive deadlock-recovery routing algorithm for k-ary n-cube networks. We intend to consider both the adaptability for faults and the communication performance by integrating regular and irregular network routing. Our algorithm tolerates any number or shape of faults without disabling fault-free nodes by maintaining routing tables that are configured based on faulty information. Our algorithm also provides minimal misrouting paths around faults by guaranteeing deadlock freedom using only two virtual channels per physical channel. Simulation results show that the proposed algorithm attains robust communication performance for uniform and nonuniform traffic patterns not only on a fault-free torus network but also on irregular tori with faulty nodes</description><subject>adaptive router</subject><subject>deadlock recovery</subject><subject>Fault tolerance</subject><subject>Fault tolerant systems</subject><subject>k-ary n-cube</subject><subject>non-minimal routing algorithm</subject><subject>Routing</subject><subject>System recovery</subject><issn>1537-3223</issn><issn>2642-4118</issn><isbn>9780769522050</isbn><isbn>076952205X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotT01Lw0AUXPwAQ83Zg5f8gY3v7W42yTFUW4NFoVQ8lu3ui8TEpOSj4r93RecyMMMMM4zdIMSIkN-Vb2URCwAVIwDqMxYIrQRXiNk5C_M0g1TniRCQwAULMJEpl0LIKxaO4wd4SO8qDNjTysztxHd9S4Pppqhw5jjVJ4ruybi2tw3fku1PNHxH236e6u49qvoharjxSsftfKDomaavfmjGa3ZZmXak8J8X7HX1sFs-8s3LulwWG15jmkw8N46kSZyiCmWOlQOdpweJ0oJKLDpChc5aKVIUmSYhyCt-_O-jjKSWC3b711sT0f441J9-zN6nQGcgfwCg606D</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Yoshinaga, T.</creator><creator>Hosogoshi, H.</creator><creator>Sowa, M.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2004</creationdate><title>Fault-Tolerant Adaptive Deadlock-Recovery Routing for k-ary n-cube Networks</title><author>Yoshinaga, T. ; Hosogoshi, H. ; Sowa, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-9ade3a5d4ef1391fd0697b313c045c1de141dcc3271286e22ee1422376958e363</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>adaptive router</topic><topic>deadlock recovery</topic><topic>Fault tolerance</topic><topic>Fault tolerant systems</topic><topic>k-ary n-cube</topic><topic>non-minimal routing algorithm</topic><topic>Routing</topic><topic>System recovery</topic><toplevel>online_resources</toplevel><creatorcontrib>Yoshinaga, T.</creatorcontrib><creatorcontrib>Hosogoshi, H.</creatorcontrib><creatorcontrib>Sowa, M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yoshinaga, T.</au><au>Hosogoshi, H.</au><au>Sowa, M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Fault-Tolerant Adaptive Deadlock-Recovery Routing for k-ary n-cube Networks</atitle><btitle>Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)</btitle><stitle>IWIA</stitle><date>2004</date><risdate>2004</risdate><spage>49</spage><epage>58</epage><pages>49-58</pages><issn>1537-3223</issn><eissn>2642-4118</eissn><isbn>9780769522050</isbn><isbn>076952205X</isbn><abstract>This paper proposes a fault-tolerant fully adaptive deadlock-recovery routing algorithm for k-ary n-cube networks. We intend to consider both the adaptability for faults and the communication performance by integrating regular and irregular network routing. Our algorithm tolerates any number or shape of faults without disabling fault-free nodes by maintaining routing tables that are configured based on faulty information. Our algorithm also provides minimal misrouting paths around faults by guaranteeing deadlock freedom using only two virtual channels per physical channel. Simulation results show that the proposed algorithm attains robust communication performance for uniform and nonuniform traffic patterns not only on a fault-free torus network but also on irregular tori with faulty nodes</abstract><pub>IEEE</pub><doi>10.1109/IWIA.2004.10016</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1537-3223 |
| ispartof | Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04), 2004, p.49-58 |
| issn | 1537-3223 2642-4118 |
| language | eng |
| recordid | cdi_ieee_primary_1410680 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | adaptive router deadlock recovery Fault tolerance Fault tolerant systems k-ary n-cube non-minimal routing algorithm Routing System recovery |
| title | Fault-Tolerant Adaptive Deadlock-Recovery Routing for k-ary n-cube Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-13T11%3A15%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Fault-Tolerant%20Adaptive%20Deadlock-Recovery%20Routing%20for%20k-ary%20n-cube%20Networks&rft.btitle=Innovative%20Architecture%20for%20Future%20Generation%20High-Performance%20Processors%20and%20Systems%20(IWIA'04)&rft.au=Yoshinaga,%20T.&rft.date=2004&rft.spage=49&rft.epage=58&rft.pages=49-58&rft.issn=1537-3223&rft.eissn=2642-4118&rft.isbn=9780769522050&rft.isbn_list=076952205X&rft_id=info:doi/10.1109/IWIA.2004.10016&rft_dat=%3Cieee_6IE%3E1410680%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1410680&rfr_iscdi=true |