The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
May. 10, 2016

Filed:

May. 29, 2014
Applicant:

International Business Machines Corporation, Armonk, NY (US);

Inventors:

Charles J. Archer, Hillsboro, OR (US);

Nysal Jan K.A., Bangalore, IN;

Sameh S. Sharkawi, Cypress, TX (US);

Attorneys:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 9/46 (2006.01); G06F 9/50 (2006.01); H04L 12/751 (2013.01); H04L 29/08 (2006.01);
U.S. Cl.
CPC ...
G06F 9/50 (2013.01); G06F 9/5061 (2013.01); G06F 9/5066 (2013.01); G06F 9/5088 (2013.01); H04L 45/02 (2013.01); H04L 67/10 (2013.01);
Abstract

Constructing a logical tree topology in a parallel computer that includes compute nodes, where each node executes a number of tasks and at least one node executes a number of tasks different from another node includes: identifying a compute node executing a greatest number of tasks; selecting, as a global root, a task from the identified compute node, including assigning the task as a local root of the identified compute node and assigning each of the other tasks of the identified compute node as a child of the local root; selecting, from each of the other compute nodes, one task to be a local root, including assigning each task other than the local root as a child of the local root; and assigning each local root of the other compute nodes to be a child of one of the tasks of the identified compute node other than the global root.


Find Patent Forward Citations

Loading…