Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

Title: Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link.

Inventors:: Archer, Charles J.; Faraj, Daniel A.; Inglett, Todd A.; Ratterman, Joseph D.

Issue Date:: 2018-01-30

OSTI Identifier:: 1418788

Assignee:: International Business Machines Corporation (Armonk, NY) OSTI

Patent Number(s):: 9,882,801

Application Number:: 13/778,581

Contract Number:: B554331

Resource Relation:: Patent File Date: 2013 Feb 27

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:

Providing Nearest Neighbor Point-to-Point Communications Among Compute Nodes of an Operational Group in a Global Combining Network of a Parallel Computer
patent-application, February 2009

Archer, Charles J.; Faraj, Ahmad A.; Inglett, Todd A.
US Patent Document 11/832955; 20090037598
URL: http://appft.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&Sect2=HITOFF&d=PG01&p=1&u=%2Fnetahtml%2FPTO%2Fsrchnum.html&r=1&f=G&l=50&s1=%2220090037598%22.PGNR.&OS=DN/20090037598&RS=DN/20090037598

Similar records in DOepatents and OSTI.GOV collections:

Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

Patent Archer, Charles J ; Faraj, Ahmad A ; Inglett, Todd A ; Ratterman, Joseph D

Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selectedmore »« less
Full Text Available April 2013
Providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

Patent Archer, Charles J. ; Faraj, Ahmad A. ; Inglett, Todd A. ; Ratterman, Joseph D.

Methods, apparatus, and products are disclosed for providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: identifying each link in the global combining network for each compute node of the operational group; designating one of a plurality of point-to-point class routing identifiers for each link such that no compute node in the operational group is connected to two adjacent compute nodes in the operational group with links designated formore »« less
Full Text Available October 2012
Configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks

Patent Archer, Charles J. ; Inglett, Todd A. ; Ratterman, Joseph D. ; Smith, Brian E.

Methods, apparatus, and products are disclosed for configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks, the compute nodes in the operational group connected together for data communications through a global combining network, that include: partitioning the compute nodes in the operational group into a plurality of non-overlapping subgroups; designating one compute node from each of the non-overlapping subgroups as a master node; and assigning, to the compute nodes in each of the non-overlapping subgroups, class routing instructions that organize the compute nodes in that non-overlapping subgroup as a collectivemore »« less
Full Text Available March 2010
Low latency, high bandwidth data communications between compute nodes in a parallel computer

Patent Archer, Charles J. ; Blocksome, Michael A. ; Ratterman, Joseph D. ; Smith, Brian E.

Methods, parallel computers, and computer program products are disclosed for low latency, high bandwidth data communications between compute nodes in a parallel computer. Embodiments include receiving, by an origin direct memory access (`DMA`) engine of an origin compute node, data for transfer to a target compute node; sending, by the origin DMA engine of the origin compute node to a target DMA engine on the target compute node, a request to send (`RTS`) message; transferring, by the origin DMA engine, a predetermined portion of the data to the target compute node using memory FIFO operation; determining, by the origin DMAmore »« less
Full Text Available November 2010
Low latency, high bandwidth data communications between compute nodes in a parallel computer

Patent Blocksome, Michael A

Methods, systems, and products are disclosed for data transfers between nodes in a parallel computer that include: receiving, by an origin DMA on an origin node, a buffer identifier for a buffer containing data for transfer to a target node; sending, by the origin DMA to the target node, a RTS message; transferring, by the origin DMA, a data portion to the target node using a memory FIFO operation that specifies one end of the buffer from which to begin transferring the data; receiving, by the origin DMA, an acknowledgement of the RTS message from the target node; and transferring,more »« less
Full Text Available July 2013