专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20080195840A1 Identifying Messaging Completion on a Parallel Computer 失效
标题翻译：识别并行计算机上的消息完成
公开(公告)号：US20080195840A1
公开(公告)日：2008-08-14
申请号：US11672989
申请日：2007-02-09
申请人： Charles J. Archer , Camesha R. Hardwick , Patrick J. McCarthy , Brian P. Wallenfelt
发明人： Charles J. Archer , Camesha R. Hardwick , Patrick J. McCarthy , Brian P. Wallenfelt
IPC分类号： G06F15/76 , G06F9/06
CPC分类号： G06F15/17337
摘要： Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependence upon the values read from the counters at each node; and determining for all nodes whether the current node value for each node is the same as a previously calculated node value for each node. If the current node is the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is complete and if the current node is not the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is currently incomplete.
摘要翻译：提供方法，并行计算机和产品用于标识并行计算机上的消息完成。并行计算机包括多个计算节点，所述计算节点被耦合用于由至少两个独立的数据通信网络进行数据通信，所述至少两个独立数据通信网络包括最佳的用于将节点组织为树的二进制树数据通信网络和圆环数据通信网络最优用于将节点组织为环面的点对点操作。实施例包括读取环面数据通信网络的每个节点处的所有计数器; 根据从每个节点处的计数器读取的值，在每个节点计算当前节点值; 以及为所有节点确定每个节点的当前节点值是否与每个节点的先前计算的节点值相同。如果当前节点与圆环数据通信网络的所有节点的先前计算的节点值相同，则实施例包括确定消息传递完成，并且如果当前节点与先前计算出的节点的所有节点的节点值不相同环面数据通信网络，实施例包括确定消息传递当前不完整。

2. 发明授权

US07552312B2 Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node 失效
标题翻译：通过检查每个节点接收的消息和发送的计数的变化来识别并行计算机中的消息完成
公开(公告)号：US07552312B2
公开(公告)日：2009-06-23
申请号：US11672989
申请日：2007-02-09
申请人： Charles J. Archer , Camesha R. Hardwick , Patrick J. McCarthy , Brian P. Wallenfelt
发明人： Charles J. Archer , Camesha R. Hardwick , Patrick J. McCarthy , Brian P. Wallenfelt
IPC分类号： G06F15/16
CPC分类号： G06F15/17337
摘要： Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependence upon the values read from the counters at each node; and determining for all nodes whether the current node value for each node is the same as a previously calculated node value for each node. If the current node is the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is complete and if the current node is not the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is currently incomplete.
摘要翻译：提供方法，并行计算机和产品用于标识并行计算机上的消息完成。并行计算机包括多个计算节点，所述计算节点被耦合用于由至少两个独立的数据通信网络进行数据通信，所述至少两个独立数据通信网络包括最佳的用于将节点组织为树的二进制树数据通信网络和圆环数据通信网络最优用于将节点组织为环面的点对点操作。实施例包括读取环面数据通信网络的每个节点处的所有计数器; 根据从每个节点处的计数器读取的值，在每个节点计算当前节点值; 以及为所有节点确定每个节点的当前节点值是否与每个节点的先前计算的节点值相同。如果当前节点与圆环数据通信网络的所有节点的先前计算的节点值相同，则实施例包括确定消息传递完成，并且如果当前节点与先前计算出的节点的所有节点的节点值不相同环面数据通信网络，实施例包括确定消息传递当前不完整。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式