Performing a scatterv operation on a hierarchical tree network optimized for collective operations

Title: Performing a scatterv operation on a hierarchical tree network optimized for collective operations

Full Record
Other Related Research

Abstract

Performing a scatterv operation on a hierarchical tree network optimized for collective operations including receiving, by the scatterv module installed on the node, from a nearest neighbor parent above the node a chunk of data having at least a portion of data for the node; maintaining, by the scatterv module installed on the node, the portion of the data for the node; determining, by the scatterv module installed on the node, whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child; and sending, by the scatterv module installed on the node, those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child.

Inventors:: Archer, Charles J; Blocksome, Michael A; Ratterman, Joseph D; Smith, Brian E

Issue Date:: 2013-10-22

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

Sponsoring Org.:: USDOE

OSTI Identifier:: 1107597

Patent Number(s):: 8565089

Application Number:: 12/748,594

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

Patent Classifications (CPCs):: G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING

Show more

G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
G06F15/17318 - {Parallel communications techniques, e.g. gather, scatter, reduce, roadcast, multicast, all to all}

Show less

DOE Contract Number:: B554331

Resource Type:: Patent

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING

Citation Formats


                    Archer, Charles J, Blocksome, Michael A, Ratterman, Joseph D, and Smith, Brian E. Performing a scatterv operation on a hierarchical tree network optimized for collective operations.  United States: N. p., 2013. 
        Web.

Copy to clipboard


                    Archer, Charles J, Blocksome, Michael A, Ratterman, Joseph D, & Smith, Brian E. Performing a scatterv operation on a hierarchical tree network optimized for collective operations.  United States.

Copy to clipboard


                    Archer, Charles J, Blocksome, Michael A, Ratterman, Joseph D, and Smith, Brian E. Tue .  
        "Performing a scatterv operation on a hierarchical tree network optimized for collective operations".  United States.  https://www.osti.gov/servlets/purl/1107597.

Copy to clipboard


                    
@article{osti_1107597,

  title        = {Performing a scatterv operation on a hierarchical tree network optimized for collective operations},

  author       = {Archer, Charles J and Blocksome, Michael A and Ratterman, Joseph D and Smith, Brian E},

  abstractNote = {Performing a scatterv operation on a hierarchical tree network optimized for collective operations including receiving, by the scatterv module installed on the node, from a nearest neighbor parent above the node a chunk of data having at least a portion of data for the node; maintaining, by the scatterv module installed on the node, the portion of the data for the node; determining, by the scatterv module installed on the node, whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child; and sending, by the scatterv module installed on the node, those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child.},

  doi          = {},

  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {2013},

  month        = {10}

}

Copy to clipboard

Patent:

View Patent

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE Patents and OSTI.GOV collections:

Performing optimized collective operations in an irregular subcommunicator of compute nodes in a parallel computer

Patent Davis, Kristan D.; Faraj, Daniel A.

In a parallel computer, performing optimized collective operations in an irregular subcommunicator of compute nodes may be carried out by: identifying, within the irregular subcommunicator, regular neighborhoods of compute nodes; selecting, for each neighborhood from the compute nodes of the neighborhood, a local root node; assigning each local root node to a node of a neighborhood-wide tree topology; mapping, for each neighborhood, the compute nodes of the neighborhood to a local tree topology having, at its root, the local root node of the neighborhood; and performing a one way, rooted collective operation within the subcommunicator including: performing, in one phase,more »« less
Full Text Available
Embedding global and collective in a torus network with message class map based tree path selection

Patent Chen, Dong; Coteus, Paul W.; Eisley, Noel A.; ...

Embodiments of the invention provide a method, system and computer program product for embedding a global barrier and global interrupt network in a parallel computer system organized as a torus network. The computer system includes a multitude of nodes. In one embodiment, the method comprises taking inputs from a set of receivers of the nodes, dividing the inputs from the receivers into a plurality of classes, combining the inputs of each of the classes to obtain a result, and sending said result to a set of senders of the nodes. Embodiments of the invention provide a method, system and computermore »« less
Full Text Available
Global tree network for computing structures enabling global processing operations

Patent Blumrich, ; Matthias, A [Ridgefield, CT]; Chen, Dong [Croton-On-Hudson, NY]; ...

A system and method for enabling high-speed, low-latency global tree network communications among processing nodes interconnected according to a tree network structure. The global tree network enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the tree via links to facilitate performance of low-latency global processing operations at nodes of the virtual tree and sub-tree structures. The global operations performed include one or more of: broadcast operations downstream from a root node to leaf nodes ofmore »« less
Full Text Available
Method and apparatus of performing a memory operation in a hierarchical memory assembly

Patent Yudanov, Dmitri

A method and apparatus of performing a memory operation includes receiving a memory operation request at a first memory controller that is in communication with a second memory controller. The first memory controller forwards the memory operation request to the second memory controller. Upon receipt of the memory operation request, the second memory controller provides first information or second information depending on a condition of a pseudo-bank of the second memory controller and a type of the memory operation request.
Full Text Available
Configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks

Patent Archer, Charles J [Rochester, MN]; Inglett, Todd A [Rochester, MN]; Ratterman, Joseph D [Rochester, MN]; ...

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

Similar Records