Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited

Kumar, Sameer

Title: Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited

Abstract

Disclosed is a mechanism on receiving processors in a parallel computing system for providing order to data packets received from a broadcast call and to distinguish data packets received at nodes from several incoming asynchronous broadcast messages where header space is limited. In the present invention, processors at lower leafs of a tree do not need to obtain a broadcast message by directly accessing the data in a root processor's buffer. Instead, each subsequent intermediate node's rank id information is squeezed into the software header of packet headers. In turn, the entire broadcast message is not transferred from the root processor to each processor in a communicator but instead is replicated on several intermediate nodes which then replicated the message to nodes in lower leafs. Hence, the intermediate compute nodes become "virtual root compute nodes" for the purpose of replicating the broadcast message to lower levels of a tree.

Inventors:: Kumar, Sameer

Issue Date:: 2010-06-15

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

Sponsoring Org.:: USDOE

OSTI Identifier:: 1176371

Patent Number(s):: 7738443

Application Number:: 11/768,619

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

Patent Classifications (CPCs):: H - ELECTRICITY H04 - ELECTRIC COMMUNICATION TECHNIQUE H04L - TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION

Show more

H - ELECTRICITY H04 - ELECTRIC COMMUNICATION TECHNIQUE H04L - TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
H04L12/1854 - {with non-centralised forwarding system, e.g. chaincast}

Show less

DOE Contract Number:: B554331

Resource Type:: Patent

Resource Relation:: Patent File Date: 2007 Jun 26

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING

Citation Formats


                    Kumar, Sameer. Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited.  United States: N. p., 2010. 
        Web.

Copy to clipboard


                    Kumar, Sameer. Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited.  United States.

Copy to clipboard


                    Kumar, Sameer. Tue .  
        "Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited".  United States.  https://www.osti.gov/servlets/purl/1176371.

Copy to clipboard


                    
@article{osti_1176371,

  title        = {Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited},

  author       = {Kumar, Sameer},

  abstractNote = {Disclosed is a mechanism on receiving processors in a parallel computing system for providing order to data packets received from a broadcast call and to distinguish data packets received at nodes from several incoming asynchronous broadcast messages where header space is limited. In the present invention, processors at lower leafs of a tree do not need to obtain a broadcast message by directly accessing the data in a root processor's buffer. Instead, each subsequent intermediate node's rank id information is squeezed into the software header of packet headers. In turn, the entire broadcast message is not transferred from the root processor to each processor in a communicator but instead is replicated on several intermediate nodes which then replicated the message to nodes in lower leafs. Hence, the intermediate compute nodes become "virtual root compute nodes" for the purpose of replicating the broadcast message to lower levels of a tree.},

  doi          = {},

  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {2010},

  month        = {6}

}

Copy to clipboard

Patent:

View Patent

Save / Share:

Export Metadata

Save to My Library

Works referenced in this record:

Performance evaluation of adaptive MPI
conference, January 2006

Huang, Chao; Zheng, Gengbin; Kalé, Laxmikant
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '06
https://doi.org/10.1145/1122971.1122976

Overview of the Blue Gene/L system architecture
journal, March 2005

Gara, A.; Blumrich, M. A.; Chen, D.
IBM Journal of Research and Development, Vol. 49, Issue 2.3
https://doi.org/10.1147/rd.492.0195

Optimization of MPI collective communication on BlueGene/L systems
conference, January 2005

Almási, George; Heidelberger, Philip; Archer, Charles J.
Proceedings of the 19th annual international conference on Supercomputing - ICS '05
https://doi.org/10.1145/1088149.1088183

Similar Records in DOE Patents and OSTI.GOV collections:

Executing scatter operation to parallel computer nodes by repeatedly broadcasting content of send buffer partition corresponding to each node upon bitwise OR operation

Patent Archer, Charles J [Rochester, MN]; Ratterman, Joseph D [Rochester, MN]

Executing a scatter operation on a parallel computer includes: configuring a send buffer on a logical root, the send buffer having positions, each position corresponding to a ranked node in an operational group of compute nodes and for storing contents scattered to that ranked node; and repeatedly for each position in the send buffer: broadcasting, by the logical root to each of the other compute nodes on a global combining network, the contents of the current position of the send buffer using a bitwise OR operation, determining, by each compute node, whether the current position in the send buffer correspondsmore »« less
Full Text Available
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
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
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
Pacing a data transfer operation between compute nodes on a parallel computer

Patent Blocksome, Michael A [Rochester, MN]

Methods, systems, and products are disclosed for pacing a data transfer between compute nodes on a parallel computer that include: transferring, by an origin compute node, a chunk of an application message to a target compute node; sending, by the origin compute node, a pacing request to a target direct memory access (`DMA`) engine on the target compute node using a remote get DMA operation; determining, by the origin compute node, whether a pacing response to the pacing request has been received from the target DMA engine; and transferring, by the origin compute node, a next chunk of the applicationmore »« less
Full Text Available

Similar Records

Title: Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited

Abstract

Citation Formats

Performance evaluation of adaptive MPI conference, January 2006

Overview of the Blue Gene/L system architecture journal, March 2005

Optimization of MPI collective communication on BlueGene/L systems conference, January 2005

Performance evaluation of adaptive MPI
conference, January 2006

Overview of the Blue Gene/L system architecture
journal, March 2005

Optimization of MPI collective communication on BlueGene/L systems
conference, January 2005