Identifying data communications algorithms of all other tasks in a single collective operation in a distributed processing system

• US 9,229,780 B2
• Filed: 11/02/2012
• Issued: 01/05/2016
• Est. Priority Date: 07/19/2011
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Archer, Charles J., Carey, James E., Markland, Matthew W., Sanders, Philip J.
• Primary Examiner(s): Zhe, Mengyao
• Assistant Examiner(s): Lee, James J
• Application Number:
  US13/667,302
• Publication Number:
  US 20130060833A1
• Time in Patent Office: 1,159 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 9/5066 Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs mappping at compile time, see G06F8/451
• CPC Class Codes: G06F 9/5072 Grid computing
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues

Abstract

Topology mapping in a distributed processing system, the distributed processing system including a plurality of compute nodes, each compute node having a plurality of tasks, each task assigned a unique rank, including: assigning each task to a geometry defining the resources available to the task; selecting, from a list of possible data communications algorithms, one or more algorithms configured for the assigned geometry; and identifying, by each task to all other tasks, the selected data communications algorithms of each task in a single collective operation.

Claims

1. A method of topology mapping in a distributed processing system, the distributed processing system including a plurality of compute nodes, each compute node executing a plurality of tasks, each task assigned a unique rank, the method comprising:

assigning each task to a geometry, wherein the geometry comprises a collection of compute nodes having distinct data communications abilities and resources available to tasks assigned to the geometry, wherein data communications abilities include one or more data communications algorithms supported by each compute nodes;

selecting, by each task from a list of possible data communications algorithms, one or more of the possible data communications algorithms supported by the compute node upon which the task is executing in the assigned geometry;

identifying, by each task, the selected data communications algorithms of all other tasks in a single collective operation, wherein the identification includes the steps of;

setting, by each task a string of bits where each bit represents a data communications algorithm available for the task being executed on the compute node, a bit to true for each algorithm selected by the task; and

performing, by all the tasks, an allreduce operation with a bitwise AND of all string of bits associated with each task; and

performing, by each task, communication with all other tasks using one or more data communication algorithms common to all tasks.

2. The method of claim 1 wherein identifying, by each task, the selected data communications algorithms of all other tasks further comprises prioritizing one or more of the selected data communications algorithms.

3. The method of claim 1 wherein a data communications algorithm is associated with a type of data communications network.

4. The method of claim 1 wherein a data communications algorithm comprises a data communications protocol.