Use of routing capability for fault-tolerant routing in hypercube multicomputers
The concept of routing capability is proposed to assist fault-tolerant routing in hypercubes. Routing capability is defined with respect to the entire spectrum of distance. As a result, the amount of information that is useful for message routing is increased. An algorithm is presented to facilitate...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on computers 1997-08, Vol.46 (8), p.953-958 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 958 |
|---|---|
| container_issue | 8 |
| container_start_page | 953 |
| container_title | IEEE transactions on computers |
| container_volume | 46 |
| creator | CHIU, G.-M CHEN, K.-S |
| description | The concept of routing capability is proposed to assist fault-tolerant routing in hypercubes. Routing capability is defined with respect to the entire spectrum of distance. As a result, the amount of information that is useful for message routing is increased. An algorithm is presented to facilitate efficient fault-tolerant routing of messages. The algorithm routes a message in an attempt to minimize derouting. Furthermore, the concept of directed routing capability which contains more useful information for fault-tolerant routing is introduced. Simulation results demonstrate the usefulness of our approach. |
| doi_str_mv | 10.1109/12.609283 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_609283</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>609283</ieee_id><sourcerecordid>28572920</sourcerecordid><originalsourceid>FETCH-LOGICAL-c372t-729032688f041ef8f69a57bf1f206bcabca39249c2b3a97ea8ad2daec65859e23</originalsourceid><addsrcrecordid>eNo9kE1LxDAQhoMouK4evHrqQQQPXSdp0yZHWfyCBT2455JmJxppm5qkh_33RrosDMxhnnmGeQm5prCiFOQDZasKJBPFCVlQzutcSl6dkgUAFbksSjgnFyH8AEDFQC7IxzZg5kzm3RTt8JVpNarWdjbuM-N8ZtTUxTy6Dr0a4pGyQ_a9H9HrqcWsT4jVrh-niD5ckjOjuoBXh74k2-enz_Vrvnl_eVs_bnJd1CzmNZNQsEoIAyVFI0wlFa9bQw2DqtUqVSFZKTVrCyVrVELt2E6hrrjgElmxJHezd_Tud8IQm94GjV2nBnRTaJjg6QaDBN7PoPYuBI-mGb3tld83FJr_zBrKmjmzxN4epCpo1Zn0tLbhuMBqwYGXCbuZMYuIx-nB8QdNhHS8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28572920</pqid></control><display><type>article</type><title>Use of routing capability for fault-tolerant routing in hypercube multicomputers</title><source>IEEE Electronic Library (IEL)</source><creator>CHIU, G.-M ; CHEN, K.-S</creator><creatorcontrib>CHIU, G.-M ; CHEN, K.-S</creatorcontrib><description>The concept of routing capability is proposed to assist fault-tolerant routing in hypercubes. Routing capability is defined with respect to the entire spectrum of distance. As a result, the amount of information that is useful for message routing is increased. An algorithm is presented to facilitate efficient fault-tolerant routing of messages. The algorithm routes a message in an attempt to minimize derouting. Furthermore, the concept of directed routing capability which contains more useful information for fault-tolerant routing is introduced. Simulation results demonstrate the usefulness of our approach.</description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/12.609283</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Broadcasting ; Computer science; control theory; systems ; Computer systems performance. Reliability ; Delay ; Exact sciences and technology ; Fault tolerance ; Hamming distance ; Hypercubes ; Peer to peer computing ; Routing ; Safety ; Software ; Upper bound</subject><ispartof>IEEE transactions on computers, 1997-08, Vol.46 (8), p.953-958</ispartof><rights>1997 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c372t-729032688f041ef8f69a57bf1f206bcabca39249c2b3a97ea8ad2daec65859e23</citedby><cites>FETCH-LOGICAL-c372t-729032688f041ef8f69a57bf1f206bcabca39249c2b3a97ea8ad2daec65859e23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/609283$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/609283$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2785054$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>CHIU, G.-M</creatorcontrib><creatorcontrib>CHEN, K.-S</creatorcontrib><title>Use of routing capability for fault-tolerant routing in hypercube multicomputers</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>The concept of routing capability is proposed to assist fault-tolerant routing in hypercubes. Routing capability is defined with respect to the entire spectrum of distance. As a result, the amount of information that is useful for message routing is increased. An algorithm is presented to facilitate efficient fault-tolerant routing of messages. The algorithm routes a message in an attempt to minimize derouting. Furthermore, the concept of directed routing capability which contains more useful information for fault-tolerant routing is introduced. Simulation results demonstrate the usefulness of our approach.</description><subject>Applied sciences</subject><subject>Broadcasting</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems performance. Reliability</subject><subject>Delay</subject><subject>Exact sciences and technology</subject><subject>Fault tolerance</subject><subject>Hamming distance</subject><subject>Hypercubes</subject><subject>Peer to peer computing</subject><subject>Routing</subject><subject>Safety</subject><subject>Software</subject><subject>Upper bound</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><recordid>eNo9kE1LxDAQhoMouK4evHrqQQQPXSdp0yZHWfyCBT2455JmJxppm5qkh_33RrosDMxhnnmGeQm5prCiFOQDZasKJBPFCVlQzutcSl6dkgUAFbksSjgnFyH8AEDFQC7IxzZg5kzm3RTt8JVpNarWdjbuM-N8ZtTUxTy6Dr0a4pGyQ_a9H9HrqcWsT4jVrh-niD5ckjOjuoBXh74k2-enz_Vrvnl_eVs_bnJd1CzmNZNQsEoIAyVFI0wlFa9bQw2DqtUqVSFZKTVrCyVrVELt2E6hrrjgElmxJHezd_Tud8IQm94GjV2nBnRTaJjg6QaDBN7PoPYuBI-mGb3tld83FJr_zBrKmjmzxN4epCpo1Zn0tLbhuMBqwYGXCbuZMYuIx-nB8QdNhHS8</recordid><startdate>19970801</startdate><enddate>19970801</enddate><creator>CHIU, G.-M</creator><creator>CHEN, K.-S</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19970801</creationdate><title>Use of routing capability for fault-tolerant routing in hypercube multicomputers</title><author>CHIU, G.-M ; CHEN, K.-S</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c372t-729032688f041ef8f69a57bf1f206bcabca39249c2b3a97ea8ad2daec65859e23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Applied sciences</topic><topic>Broadcasting</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems performance. Reliability</topic><topic>Delay</topic><topic>Exact sciences and technology</topic><topic>Fault tolerance</topic><topic>Hamming distance</topic><topic>Hypercubes</topic><topic>Peer to peer computing</topic><topic>Routing</topic><topic>Safety</topic><topic>Software</topic><topic>Upper bound</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>CHIU, G.-M</creatorcontrib><creatorcontrib>CHEN, K.-S</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>CHIU, G.-M</au><au>CHEN, K.-S</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Use of routing capability for fault-tolerant routing in hypercube multicomputers</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>1997-08-01</date><risdate>1997</risdate><volume>46</volume><issue>8</issue><spage>953</spage><epage>958</epage><pages>953-958</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>The concept of routing capability is proposed to assist fault-tolerant routing in hypercubes. Routing capability is defined with respect to the entire spectrum of distance. As a result, the amount of information that is useful for message routing is increased. An algorithm is presented to facilitate efficient fault-tolerant routing of messages. The algorithm routes a message in an attempt to minimize derouting. Furthermore, the concept of directed routing capability which contains more useful information for fault-tolerant routing is introduced. Simulation results demonstrate the usefulness of our approach.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/12.609283</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9340 |
| ispartof | IEEE transactions on computers, 1997-08, Vol.46 (8), p.953-958 |
| issn | 0018-9340 1557-9956 |
| language | eng |
| recordid | cdi_ieee_primary_609283 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Broadcasting Computer science control theory systems Computer systems performance. Reliability Delay Exact sciences and technology Fault tolerance Hamming distance Hypercubes Peer to peer computing Routing Safety Software Upper bound |
| title | Use of routing capability for fault-tolerant routing in hypercube multicomputers |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-16T07%3A04%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Use%20of%20routing%20capability%20for%20fault-tolerant%20routing%20in%20hypercube%20multicomputers&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=CHIU,%20G.-M&rft.date=1997-08-01&rft.volume=46&rft.issue=8&rft.spage=953&rft.epage=958&rft.pages=953-958&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/12.609283&rft_dat=%3Cproquest_RIE%3E28572920%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28572920&rft_id=info:pmid/&rft_ieee_id=609283&rfr_iscdi=true |