DYNAMICALLY REROUTING NODE TRAFFIC ON A PARALLEL COMPUTER SYSTEM

DYNAMICALLY REROUTING NODE TRAFFIC ON A PARALLEL COMPUTER SYSTEM

A method and apparatus for dynamically rerouting node processes on the compute nodes of a massively parallel computer system using hint bits to route around failed nodes or congested networks without restarting applications executing on the system. When a node has a failure or there are indications...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: SMITH BRIAN EDWARD, SIDELNIK ALBERT, MCCARTHY PATRICK JOSEPH, PETERS AMANDA, DARRINGTON DAVID, SWARTZ BRENT ALLEN
Format: Patent
Sprache:eng
Schlagworte:
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator SMITH BRIAN EDWARD
SIDELNIK ALBERT
MCCARTHY PATRICK JOSEPH
PETERS AMANDA
DARRINGTON DAVID
SWARTZ BRENT ALLEN
description A method and apparatus for dynamically rerouting node processes on the compute nodes of a massively parallel computer system using hint bits to route around failed nodes or congested networks without restarting applications executing on the system. When a node has a failure or there are indications that it may fail, the application software on the system is suspended while the data on the failed node is moved to a backup node. The torus network traffic is routed around the failed node and traffic for the failed node is rerouted to the backup node. The application can then resume operation without restarting from the beginning.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_KR20090122209A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>KR20090122209A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_KR20090122209A3</originalsourceid><addsrcrecordid>eNrjZHBwifRz9PV0dvTxiVQIcg3yDw3x9HNX8PN3cVUICXJ0c_N0VvD3U3BUCHAMAqpx9VFw9vcNCA1xDVIIjgwOcfXlYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXx3kFGBgaWBoZGRkYGlo7GxKkCAGDWK5M</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>DYNAMICALLY REROUTING NODE TRAFFIC ON A PARALLEL COMPUTER SYSTEM</title><source>esp@cenet</source><creator>SMITH BRIAN EDWARD ; SIDELNIK ALBERT ; MCCARTHY PATRICK JOSEPH ; PETERS AMANDA ; DARRINGTON DAVID ; SWARTZ BRENT ALLEN</creator><creatorcontrib>SMITH BRIAN EDWARD ; SIDELNIK ALBERT ; MCCARTHY PATRICK JOSEPH ; PETERS AMANDA ; DARRINGTON DAVID ; SWARTZ BRENT ALLEN</creatorcontrib><description>A method and apparatus for dynamically rerouting node processes on the compute nodes of a massively parallel computer system using hint bits to route around failed nodes or congested networks without restarting applications executing on the system. When a node has a failure or there are indications that it may fail, the application software on the system is suspended while the data on the failed node is moved to a backup node. The torus network traffic is routed around the failed node and traffic for the failed node is rerouted to the backup node. The application can then resume operation without restarting from the beginning.</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2009</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20091126&amp;DB=EPODOC&amp;CC=KR&amp;NR=20090122209A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,309,781,886,25566,76549</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20091126&amp;DB=EPODOC&amp;CC=KR&amp;NR=20090122209A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>SMITH BRIAN EDWARD</creatorcontrib><creatorcontrib>SIDELNIK ALBERT</creatorcontrib><creatorcontrib>MCCARTHY PATRICK JOSEPH</creatorcontrib><creatorcontrib>PETERS AMANDA</creatorcontrib><creatorcontrib>DARRINGTON DAVID</creatorcontrib><creatorcontrib>SWARTZ BRENT ALLEN</creatorcontrib><title>DYNAMICALLY REROUTING NODE TRAFFIC ON A PARALLEL COMPUTER SYSTEM</title><description>A method and apparatus for dynamically rerouting node processes on the compute nodes of a massively parallel computer system using hint bits to route around failed nodes or congested networks without restarting applications executing on the system. When a node has a failure or there are indications that it may fail, the application software on the system is suspended while the data on the failed node is moved to a backup node. The torus network traffic is routed around the failed node and traffic for the failed node is rerouted to the backup node. The application can then resume operation without restarting from the beginning.</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2009</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHBwifRz9PV0dvTxiVQIcg3yDw3x9HNX8PN3cVUICXJ0c_N0VvD3U3BUCHAMAqpx9VFw9vcNCA1xDVIIjgwOcfXlYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXx3kFGBgaWBoZGRkYGlo7GxKkCAGDWK5M</recordid><startdate>20091126</startdate><enddate>20091126</enddate><creator>SMITH BRIAN EDWARD</creator><creator>SIDELNIK ALBERT</creator><creator>MCCARTHY PATRICK JOSEPH</creator><creator>PETERS AMANDA</creator><creator>DARRINGTON DAVID</creator><creator>SWARTZ BRENT ALLEN</creator><scope>EVB</scope></search><sort><creationdate>20091126</creationdate><title>DYNAMICALLY REROUTING NODE TRAFFIC ON A PARALLEL COMPUTER SYSTEM</title><author>SMITH BRIAN EDWARD ; SIDELNIK ALBERT ; MCCARTHY PATRICK JOSEPH ; PETERS AMANDA ; DARRINGTON DAVID ; SWARTZ BRENT ALLEN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_KR20090122209A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2009</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>SMITH BRIAN EDWARD</creatorcontrib><creatorcontrib>SIDELNIK ALBERT</creatorcontrib><creatorcontrib>MCCARTHY PATRICK JOSEPH</creatorcontrib><creatorcontrib>PETERS AMANDA</creatorcontrib><creatorcontrib>DARRINGTON DAVID</creatorcontrib><creatorcontrib>SWARTZ BRENT ALLEN</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>SMITH BRIAN EDWARD</au><au>SIDELNIK ALBERT</au><au>MCCARTHY PATRICK JOSEPH</au><au>PETERS AMANDA</au><au>DARRINGTON DAVID</au><au>SWARTZ BRENT ALLEN</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>DYNAMICALLY REROUTING NODE TRAFFIC ON A PARALLEL COMPUTER SYSTEM</title><date>2009-11-26</date><risdate>2009</risdate><abstract>A method and apparatus for dynamically rerouting node processes on the compute nodes of a massively parallel computer system using hint bits to route around failed nodes or congested networks without restarting applications executing on the system. When a node has a failure or there are indications that it may fail, the application software on the system is suspended while the data on the failed node is moved to a backup node. The torus network traffic is routed around the failed node and traffic for the failed node is rerouted to the backup node. The application can then resume operation without restarting from the beginning.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_KR20090122209A
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title DYNAMICALLY REROUTING NODE TRAFFIC ON A PARALLEL COMPUTER SYSTEM
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-18T06%3A05%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=SMITH%20BRIAN%20EDWARD&rft.date=2009-11-26&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EKR20090122209A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true