会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • Executing Multiple Instructions Multiple Data ('MIMD') Programs on a Single Instruction Multiple Data ('SIMD') Machine
    • 在单指令多数据(“SIMD”)机器上执行多指令多数据('MIMD')程序
    • US20080288746A1
    • 2008-11-20
    • US11749397
    • 2007-05-16
    • Todd A. InglettPatrick J. McCarthyAmanda Peters
    • Todd A. InglettPatrick J. McCarthyAmanda Peters
    • G06F9/30
    • G06F9/5061
    • Executing MIMD programs on a SIMD machine, the SIMD machine including a plurality of compute nodes, each compute node capable of executing only a single thread of execution, the compute nodes initially configured exclusively for SIMD operations, the SIMD machine further comprising a data communications network, the network comprising synchronous data communications links among the compute nodes, including establishing one or more SIMD partitions, booting one or more SIMD partitions in MIMD mode; establishing a MIMD partition; executing by launcher programs a plurality of MIMD programs on two or more of the compute nodes of the MIMD partition; and re-executing a launcher program by an operating system on a compute node in the MIMD partition upon termination of the MIMD program executed by the launcher program.
    • 在SIMD机器上执行MIMD程序,所述SIMD机器包括多个计算节点,每个计算节点仅能够执行单个执行线程,所述计算节点最初被配置为专用于SIMD操作,所述SIMD机器还包括数据通信网络 所述网络包括所述计算节点之间的同步数据通信链路,包括建立一个或多个SIMD分区,以MIMD模式引导一个或多个SIMD分区; 建立MIMD分区; 通过发射器程序在MIMD分区的两个或更多个计算节点上执行多个MIMD程序; 以及当由所述启动程序执行的MIMD程序终止时,由MIMD分区中的计算节点上的操作系统重新执行启动程序。
    • 8. 发明授权
    • 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. ArcherCamesha R. HardwickPatrick J. McCarthyBrian P. Wallenfelt
    • Charles J. ArcherCamesha R. HardwickPatrick J. McCarthyBrian P. Wallenfelt
    • G06F15/16
    • 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.
    • 提供方法,并行计算机和产品用于标识并行计算机上的消息完成。 并行计算机包括多个计算节点,所述计算节点被耦合用于由至少两个独立的数据通信网络进行数据通信,所述至少两个独立数据通信网络包括最佳的用于将节点组织为树的二进制树数据通信网络和圆环数据通信网络最优 用于将节点组织为环面的点对点操作。 实施例包括读取环面数据通信网络的每个节点处的所有计数器; 根据从每个节点处的计数器读取的值,在每个节点计算当前节点值; 以及为所有节点确定每个节点的当前节点值是否与每个节点的先前计算的节点值相同。 如果当前节点与圆环数据通信网络的所有节点的先前计算的节点值相同,则实施例包括确定消息传递完成,并且如果当前节点与先前计算出的节点的所有节点的节点值不相同 环面数据通信网络,实施例包括确定消息传递当前不完整。