Implementing asyncronous collective operations in a multi-node processing system

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip; Kumar, Sameer; Salapura, Valentina; Steinmacher-Burow, Burkhard

Title: Implementing asyncronous collective operations in a multi-node processing system

Full Record
Other Related Research

Abstract

A method, system, and computer program product are disclosed for implementing an asynchronous collective operation in a multi-node data processing system. In one embodiment, the method comprises sending data to a plurality of nodes in the data processing system, broadcasting a remote get to the plurality of nodes, and using this remote get to implement asynchronous collective operations on the data by the plurality of nodes. In one embodiment, each of the nodes performs only one task in the asynchronous operations, and each nodes sets up a base address table with an entry for a base address of a memory buffer associated with said each node. In another embodiment, each of the nodes performs a plurality of tasks in said collective operations, and each task of each node sets up a base address table with an entry for a base address of a memory buffer associated with the task.

Inventors:: Chen, Dong; Eisley, Noel A.; Heidelberger, Philip; Kumar, Sameer; Salapura, Valentina; Steinmacher-Burow, Burkhard

Issue Date:: 2014-07-08

Research Org.:: International Business Machines Corporation, Armonk, NY (USA)

Sponsoring Org.:: USDOE

OSTI Identifier:: 1143663

Patent Number(s):: 8782164

Application Number:: 12/697,043

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/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs {

Show less

DOE Contract Number:: B554331

Resource Type:: Patent

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING

Citation Formats


                    Chen, Dong, Eisley, Noel A., Heidelberger, Philip, Kumar, Sameer, Salapura, Valentina, and Steinmacher-Burow, Burkhard. Implementing asyncronous collective operations in a multi-node processing system.  United States: N. p., 2014. 
        Web.

Copy to clipboard


                    Chen, Dong, Eisley, Noel A., Heidelberger, Philip, Kumar, Sameer, Salapura, Valentina, & Steinmacher-Burow, Burkhard. Implementing asyncronous collective operations in a multi-node processing system.  United States.

Copy to clipboard


                    Chen, Dong, Eisley, Noel A., Heidelberger, Philip, Kumar, Sameer, Salapura, Valentina, and Steinmacher-Burow, Burkhard. Tue .  
        "Implementing asyncronous collective operations in a multi-node processing system".  United States.  https://www.osti.gov/servlets/purl/1143663.

Copy to clipboard


                    
@article{osti_1143663,

  title        = {Implementing asyncronous collective operations in a multi-node processing system},

  author       = {Chen, Dong and Eisley, Noel A. and Heidelberger, Philip and Kumar, Sameer and Salapura, Valentina and Steinmacher-Burow, Burkhard},

  abstractNote = {A method, system, and computer program product are disclosed for implementing an asynchronous collective operation in a multi-node data processing system. In one embodiment, the method comprises sending data to a plurality of nodes in the data processing system, broadcasting a remote get to the plurality of nodes, and using this remote get to implement asynchronous collective operations on the data by the plurality of nodes. In one embodiment, each of the nodes performs only one task in the asynchronous operations, and each nodes sets up a base address table with an entry for a base address of a memory buffer associated with said each node. In another embodiment, each of the nodes performs a plurality of tasks in said collective operations, and each task of each node sets up a base address table with an entry for a base address of a memory buffer associated with the task.},

  doi          = {},

  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {2014},

  month        = {7}

}

Copy to clipboard

Patent:

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE Patents and OSTI.GOV collections:

Efficient implementation of multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

Patent Bhanot, Gyan V [Princeton, NJ]; Chen, Dong [Croton-On-Hudson, NY]; Gara, Alan G [Mount Kisco, NY]; ...

The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributingmore » « less
Full Text Available
Efficient implementation of a multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

Patent Bhanot, Gyan V [Princeton, NJ]; Chen, Dong [Croton-On-Hudson, NY]; Gara, Alan G [Mount Kisco, NY]; ...

The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributingmore » « less
Full Text Available
Performing optimized collective operations in a irregular subcommunicator of compute nodes in a parallel computer

Patent Davis, Kristan Suzanne 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
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
Reducing power consumption while performing collective operations on a plurality of compute nodes

Patent Archer, Charles J [Rochester, MN]; Blocksome, Michael A [Rochester, MN]; Peters, Amanda E [Rochester, MN]; ...

Methods, apparatus, and products are disclosed for reducing power consumption while performing collective operations on a plurality of compute nodes that include: receiving, by each compute node, instructions to perform a type of collective operation; selecting, by each compute node from a plurality of collective operations for the collective operation type, a particular collective operation in dependence upon power consumption characteristics for each of the plurality of collective operations; and executing, by each compute node, the selected collective operation.
Full Text Available

Similar Records