I/O routing in a multidimensional torus network

Title: I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

Inventors:: Chen, Dong; Eisley, Noel A.; Heidelberger, Philip

Issue Date:: 2017-02-07

OSTI Identifier:: 1343271

Assignee:: International Business Machines Corporation OSTI

Patent Number(s):: 9,565,094

Application Number:: 12/697,175

Contract Number:: B554331

Resource Relation:: Patent File Date: 2010 Jan 29

Research Org:: International Business Machines Corporation, Armonk, NY (United States)

Sponsoring Org:: USDOE

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING

Full Text
View Full Text

Other works cited in this record:

Mesh parallel computer architecture apparatus and associated methods
patent, May 1998

Gilbert, Ira
US Patent Document 5,752,068
URL: http://patft.uspto.gov/netacgi/nph-Parser?Sect2=PTO1&Sect2=HITOFF&p=1&u=/netahtml/PTO/search-bool.html&r=1&f=G&l=50&d=PALL&RefSrch=yes&Query=PN/5752068

Asynchronous packet switching
patent, September 1999

Wicki, Thomas; Helland, Patrick; Shimizu, Takeshi
US Patent Document 5,959,995
URL: http://patft.uspto.gov/netacgi/nph-Parser?Sect2=PTO1&Sect2=HITOFF&p=1&u=/netahtml/PTO/search-bool.html&r=1&f=G&l=50&d=PALL&RefSrch=yes&Query=PN/5959995

Interconnect fault detection and localization method and apparatus
patent, November 1999

Sastry, Raghu; Larson, Jeffrey; Mu, Albert
US Patent Document 5,987,629
URL: http://patft.uspto.gov/netacgi/nph-Parser?Sect2=PTO1&Sect2=HITOFF&p=1&u=/netahtml/PTO/search-bool.html&r=1&f=G&l=50&d=PALL&RefSrch=yes&Query=PN/5987629

Optimized scalable network switch
patent, December 2007

Blumrich, Matthias; Chen, Dong; Coteus, Paul
US Patent Document 7,305,487
URL: http://patft.uspto.gov/netacgi/nph-Parser?Sect2=PTO1&Sect2=HITOFF&p=1&u=/netahtml/PTO/search-bool.html&r=1&f=G&l=50&d=PALL&RefSrch=yes&Query=PN/7305487

Similar records in DOepatents and OSTI.GOV collections:

I/O routing in a multidimensional torus network

Patent Chen, Dong ; Eisley, Noel A. ; Heidelberger, Philip

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destinationmore »« less
Full Text Available April 2018
Zone routing in a torus network

Patent Chen, Dong ; Heidelberger, Philip ; Kumar, Sameer

A system for routing data in a network comprising a network logic device at a sending node for determining a path between the sending node and a receiving node, wherein the network logic device sets one or more selection bits and one or more hint bits within the data packet, a control register for storing one or more masks, wherein the network logic device uses the one or more selection bits to select a mask from the control register and the network logic device applies the selected mask to the hint bits to restrict routing of the data packet tomore »« less
Full Text Available January 2013
System for routing messages in a vertex symmetric network by using addresses formed from permutations of the transmission line indicees

Patent Faber, Vance ; Moore, James W.

A network of interconnected processors is formed from a vertex symmetric graph selected from graphs .GAMMA..sub.d (k) with degree d, diameter k, and (d+1)!/(d-k+1)! processors for each d.gtoreq.k and .GAMMA..sub.d (k,-1) with degree 3-1, diameter k+1, and (d+1)!/(d-k+1)! processors for each d.gtoreq.k.gtoreq.4. Each processor has an address formed by one of the permutations from a predetermined sequence of letters chosen a selected number of letters at a time, and an extended address formed by appending to the address the remaining ones of the predetermined sequence of letters. A plurality of transmission channels is provided from each of the processors, wheremore »« less
Full Text Available January 1992
Lambda network having 2.sup.m-1 nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

Patent Napolitano, Jr., Leonard M.

The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance.
Full Text Available January 1995
Class network routing

Patent Bhanot, Gyan ; Blumrich, Matthias A ; Chen, Dong ; Coteus, Paul W ; Gara, Alan G ; Giampapa, Mark E ; Heidelberger, Philip ; Steinmacher-Burow, Burkhard D ; Takken, Todd E ; Vranas, Pavlos M

Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as themore »« less
Full Text Available September 2009