skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

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:
;
Publication Date:
Research Org.:
International Business Machines Corporation, Armonk, NY (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1261604
Patent Number(s):
9,390,054
Application Number:
14/053,171
Assignee:
International Business Machines Corporation (Armonk, NY) OSTI
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.
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.
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.
@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}
}

Patent:

Save / Share: