Identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer

Title: Identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer

Abstract

In a parallel computer, a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator may be identified by: identifying, by each compute node of the subcommunicator, all logical planes that include the compute node; calculating, by each compute node for each identified logical plane that includes the compute node, an area of the identified logical plane; initiating, by a root node of the subcommunicator, a gather operation; receiving, by the root node from each compute node of the subcommunicator, each node's calculated areas as contribution data to the gather operation; and identifying, by the root node in dependence upon the received calculated areas, a logical plane of the subcommunicator having the greatest area.

Inventors:: Davis, Kristan D.; Faraj, Daniel A.

Issue Date:: 2016-07-12

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

Sponsoring Org.:: USDOE

OSTI Identifier:: 1261604

Patent Number(s):: 9390054

Application Number:: 14/053,171

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

Resource Relation:: Patent File Date: 2013 Oct 14

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING

Citation Formats


                    Davis, Kristan D., and Faraj, Daniel A. Identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer.  United States: N. p., 2016. 
        Web.

Copy to clipboard


                    Davis, Kristan D., & Faraj, Daniel A. Identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer.  United States.

Copy to clipboard


                    Davis, Kristan D., and Faraj, Daniel A. Tue .  
        "Identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer".  United States.  https://www.osti.gov/servlets/purl/1261604.

Copy to clipboard


                    
@article{osti_1261604,

  title        = {Identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer},

  author       = {Davis, Kristan D. and Faraj, Daniel A.},

  abstractNote = {In a parallel computer, a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator may be identified by: identifying, by each compute node of the subcommunicator, all logical planes that include the compute node; calculating, by each compute node for each identified logical plane that includes the compute node, an area of the identified logical plane; initiating, by a root node of the subcommunicator, a gather operation; receiving, by the root node from each compute node of the subcommunicator, each node's calculated areas as contribution data to the gather operation; and identifying, by the root node in dependence upon the received calculated areas, a logical plane of the subcommunicator having the greatest area.},

  doi          = {},

  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {2016},

  month        = {7}

}

Copy to clipboard

Patent:

View Patent

Save / Share:

Export Metadata

Save to My Library

Works referenced in this record:

Blue Gene system software---Topology mapping for Blue Gene/L supercomputer
conference, January 2006

Yu, Hao; Chung, I-Hsin; Moreira, Jose
Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06
https://doi.org/10.1145/1188455.1188576

Implementing the MPI Process Topology Mechanism
conference, January 2002

Traff, J. L.
ACM/IEEE SC 2002 Conference (SC'02)
https://doi.org/10.1109/SC.2002.10045

TASC: topology adaptive spatial clustering for sensor networks
conference, January 2005

Virrankoski, R.; Savvides, A.
IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.
https://doi.org/10.1109/MAHSS.2005.1542850

Similar Records in DOE Patents and OSTI.GOV collections:

Identifying logical planes formed of compute nodes of a subcommunicator in a parallel computer

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

In a parallel computer, a plurality of logical planes formed of compute nodes of a subcommunicator may be identified by: for each compute node of the subcommunicator and for a number of dimensions beginning with a first dimension: establishing, by a plane building node, in a positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a positive direction of a second dimension, where the second dimension is orthogonal to the first dimension; and establishing, by the plane building node, in a negative direction of the first dimension,more »« less
Full Text Available
Identifying logical planes formed of compute nodes of a subcommunicator in a parallel computer

Patent Davis, Kristan D.; Faraj, Daniel

In a parallel computer, a plurality of logical planes formed of compute nodes of a subcommunicator may be identified by: for each compute node of the subcommunicator and for a number of dimensions beginning with a first dimension: establishing, by a plane building node, in a positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a positive direction of a second dimension, where the second dimension is orthogonal to the first dimension; and establishing, by the plane building node, in a negative direction of the first dimension,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
Scheduling applications for execution on a plurality of compute nodes of a parallel computer to manage temperature of the nodes during execution

Patent Archer, Charles J; Blocksome, Michael A; Peters, Amanda E; ...

Methods, apparatus, and products are disclosed for scheduling applications for execution on a plurality of compute nodes of a parallel computer to manage temperature of the plurality of compute nodes during execution that include: identifying one or more applications for execution on the plurality of compute nodes; creating a plurality of physically discontiguous node partitions in dependence upon temperature characteristics for the compute nodes and a physical topology for the compute nodes, each discontiguous node partition specifying a collection of physically adjacent compute nodes; and assigning, for each application, that application to one or more of the discontiguous node partitionsmore »« less
Full Text Available
Performing an allreduce operation on a plurality of compute nodes of a parallel computer

Patent Faraj, Ahmad

Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: establishing, for each node, a plurality of logical rings, each ring including a different set of at least one core on that node, each ring including the cores on at least two of the nodes; iteratively for each node: assigning each core of that node to one of the rings established for that node to which the core has not previously been assigned, and performing, for each ring formore »« less
Full Text Available

Similar Records

Title: Identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer

Abstract

Citation Formats

Blue Gene system software---Topology mapping for Blue Gene/L supercomputer conference, January 2006

Implementing the MPI Process Topology Mechanism conference, January 2002

TASC: topology adaptive spatial clustering for sensor networks conference, January 2005

Blue Gene system software---Topology mapping for Blue Gene/L supercomputer
conference, January 2006

Implementing the MPI Process Topology Mechanism
conference, January 2002

TASC: topology adaptive spatial clustering for sensor networks
conference, January 2005