All-to-all message exchange in parallel computing systems
AssigneeInternational Business Machines Corporation
InventorsCyriel J. Minkenberg, Bogdan Prisacari, German Rodriguez Herrera
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsCyriel J. Minkenberg, Bogdan Prisacari, German Rodriguez Herrera
Estimating the term…
A method for all-to-all message exchange between program tasks including N>1 hierarchy levels ln, n=1 to N, in which a first level l1 includes a plurality of group tasks and each higher level l(n>1) includes at least one group of level l(n-1) groups to which that task belongs in respective hierarchy levels of the network topology; sending a message via the interconnection network to a respective destination task whose hierarchical identifier is determined; and using the hierarchical identifier to send the program task and the network topology, such that the resulting exchange pattern for the all-to-all message exchange exploits a hierarchical distance in the network topology in a desired manner.
A method for all-to-all message exchange between program tasks connected by an interconnection network with a hierarchical network topology including N>1 hierarchy levels ln, n=1 to N, in which a first level l1 includes a plurality of groups of tasks, and each higher level l(n>1) includes at least one group of level l(n-1) groups, the method comprising:
A parallel computing system for all-to-all message exchange between program tasks connected by an interconnection network with a hierarchical network topology, comprising:
A non-transitory computer readable medium storing a computer program, comprising program code means for causing a compute node to perform, collectively with other compute nodes, to perform a method for all-to-all message exchange between program tasks connected by an interconnection network with a hierarchical network topology including N>1 hierarchy levels ln, n=1 to N, in which a first level l1 includes a plurality of groups of tasks, and each higher level l(n>1) includes at least one group of level l(n-1) groups, the method comprising:
Dependencies are inferred from the claim text.