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:
- Issue Date:
- Research Org.:
- International Business Machines Corp., 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)
- 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}
}
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
Implementing the MPI Process Topology Mechanism
conference, January 2002
- Traff, J. L.
- ACM/IEEE SC 2002 Conference (SC'02)
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.