Performing a rooted-v collective operation by an operational group of compute nodes in a parallel computer
    9.
    发明授权
    Performing a rooted-v collective operation by an operational group of compute nodes in a parallel computer 有权
    由并行计算机中的计算节点的操作组执行root-v集合操作

    公开(公告)号:US09411777B2

    公开(公告)日:2016-08-09

    申请号:US14487251

    申请日:2014-09-16

    IPC分类号: G06F9/54 G06F15/173

    摘要: In a parallel computer, performing a rooted-v collective operation by an operational group of compute nodes includes: identifying, in source code by a collective algorithm selection optimizing module, a gather operation followed by a rooted-v collective operation; replacing, by the collective algorithm selection optimizing module, the gather operation with an allgather operation; executing, by the compute nodes, the allgather operation; selecting, by each compute node in dependence upon results of the allgather operation, an algorithm for effecting the rooted-v collective operation; and executing, by each compute node, the rooted-v collective operation with the selected algorithm.

    摘要翻译: 在并行计算机中,由计算节点的操作组执行root-v集合操作包括:在源代码中通过集体算法选择优化模块识别收集操作,随后是根v集合操作; 通过集合算法选择优化模块替换采集操作; 由计算节点执行allgather操作; 根据整个算法的结果,由每个计算节点选择用于实现根v集合操作的算法; 并且通过所选择的算法由每个计算节点执行带root-v的集合操作。

    Identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer
    10.
    发明授权
    Identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer 有权
    从并行计算机中的子通信器的计算节点形成的多个逻辑平面中识别最大的逻辑平面

    公开(公告)号:US09390054B2

    公开(公告)日:2016-07-12

    申请号:US14053171

    申请日:2013-10-14

    IPC分类号: G06F15/173

    CPC分类号: G06F15/17318

    摘要: 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.

    摘要翻译: 在并行计算机中,可以通过以下方式来识别来自由子通信器的计算节点形成的多个逻辑平面的最大逻辑平面:由子通信器的每个计算节点识别包括计算节点的所有逻辑平面; 由每个计算节点针对包括计算节点的每个识别的逻辑平面计算所识别的逻辑平面的面积; 通过子通信器的根节点发起收集操作; 由根节点从子通信器的每个计算节点接收每个节点的计算区域作为收集操作的贡献数据; 并且根据所接收的计算区域,根节点识别具有最大面积的子通信器的逻辑平面。