会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 66. 发明授权
    • Send-side matching of data communications messages
    • 数据通信消息的发送端匹配
    • US08776081B2
    • 2014-07-08
    • US12881863
    • 2010-09-14
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • G06F13/00G06F15/16G06F15/173G06F9/54G06F9/46
    • G06F9/546G06F9/46G06F9/52G06F15/16G06F15/17312
    • Send-side matching of data communications messages includes a plurality of compute nodes organized for collective operations, including: issuing by a receiving node to source nodes a receive message that specifies receipt of a single message to be sent from any source node, the receive message including message matching information, a specification of a hardware-level mutual exclusion device, and an identification of a receive buffer; matching by two or more of the source nodes the receive message with pending send messages in the two or more source nodes; operating by one of the source nodes having a matching send message the mutual exclusion device, excluding messages from other source nodes with matching send messages and identifying to the receiving node the source node operating the mutual exclusion device; and sending to the receiving node from the source node operating the mutual exclusion device a matched pending message.
    • 数据通信消息的发送侧匹配包括为集体操作组织的多个计算节点,包括:由接收节点向源节点发出指定从任何源节点发送的单个消息的接收的接收消息,接收消息 包括消息匹配信息,硬件级互斥设备的规范以及接收缓冲器的标识; 由两个或多个源节点匹配接收消息与两个或多个源节点中的待发送消息; 由具有匹配发送消息的源节点之一的互斥设备操作,排除来自具有匹配发送消息的其他源节点的消息,并且向接收节点标识操作互斥设备的源节点; 以及从所述源节点向所述接收节点发送操作所述互斥设备匹配的等待消息。
    • 68. 发明申请
    • Optimizing Collective Communications Within A Parallel Computer
    • 并行计算机内集体通信优化
    • US20140047451A1
    • 2014-02-13
    • US13569614
    • 2012-08-08
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • G06F9/46
    • G06F9/5061G06F2209/505
    • Methods, apparatuses, and computer program products for optimizing collective communications within a parallel computer comprising a plurality of hardware threads for executing software threads of a parallel application are provided. Embodiments include a processor of a parallel computer determining for each software thread, an affinity of the software thread to a particular hardware thread. Each affinity indicates an assignment of a software thread to a particular hardware thread. The processor also generates one or more affinity domains based on the affinities of the software threads. Embodiments also include a processor generating, for each affinity domain, a topology of the affinity domain based on the affinities of the software threads to the hardware threads. According to embodiments of the present application, a processor also performs, based on the generated topologies of the affinity domains, a collective operation on one or more software threads.
    • 提供了用于优化并行计算机内的集体通信的方法,装置和计算机程序产品,其包括用于执行并行应用的软件线程的多个硬件线程。 实施例包括并行计算机的处理器,为每个软件线程确定软件线程与特定硬件线程的亲和度。 每个相关性表示将软件线程分配给特定的硬件线程。 处理器还基于软件线程的亲和性生成一个或多个关联域。 实施例还包括基于软件线程对​​硬件线程的亲和性,针对每个关联域产生兴趣域的拓扑的处理器。 根据本申请的实施例,处理器还基于所生成的关联域的拓扑来执行对一个或多个软件线程的集合操作。
    • 69. 发明授权
    • Endpoint-based parallel data processing in a parallel active messaging interface of a parallel computer
    • 并行计算机的并行活动消息接口中基于端点的并行数据处理
    • US08650262B2
    • 2014-02-11
    • US12963671
    • 2010-12-09
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • G06F15/16
    • G06F9/541
    • Endpoint-based parallel data processing in a parallel active messaging interface (‘PAMI’) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes coupled for data communications through the PAMI, including establishing a data communications geometry, the geometry specifying, for tasks representing processes of execution of the parallel application, a set of endpoints that are used in collective operations of the PAMI including a plurality of endpoints for one of the tasks; receiving in endpoints of the geometry an instruction for a collective operation; and executing the instruction for a collective operation through the endpoints in dependence upon the geometry, including dividing data communications operations among the plurality of endpoints for one of the tasks.
    • 并行计算机的并行活动消息接口(“PAMI”)中的基于端点的并行数据处理,由数据通信端点组成的PAMI,每个端点包括计算节点上的执行线程的数据通信参数的规范,包括 客户端的规范,上下文和任务,用于通过PAMI进行数据通信的计算节点,包括建立数据通信几何,表示并行应用执行过程的任务的几何形状,一组端点, 用于PAMI的集合操作,包括用于任务之一的多个端点; 在几何的端点中接收集体操作的指令; 以及根据所述几何,通过所述端点执行用于集体操作的指令,包括为所述任务之一划分所述多个端点之间的数据通信操作。
    • 70. 发明授权
    • Distributed administration of a lock for an operational group of compute nodes in a hierarchical tree structured network
    • 分布式管理层级树结构化网络中计算节点的操作组的锁
    • US08606979B2
    • 2013-12-10
    • US12748579
    • 2010-03-29
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • G06F12/00
    • G06F9/526
    • Distributed administration of a lock for an operational group of compute nodes in a hierarchical tree structured network including assigning the root node of the operational group to send acknowledgments for lock requests, the root lock administration module comprising a module of automated computing machinery; receiving a lock request assigned to a particular node from a child node; determining whether another request from another child is directly ahead in an acknowledgement queue; if a request from another child is directly ahead in the acknowledgement queue, putting the lock request for the particular node in the acknowledgement queue until the lock request directly ahead in the acknowledgement queue is satisfied and when the lock request ahead in the queue is satisfied, sending the particular node for whom the lock request is assigned a message acknowledging the particular node has the lock; and if a request from another child is not directly ahead in a queue, sending to the particular node for whom the lock request is assigned a message acknowledging that the particular node has the lock.
    • 分层管理分层树结构化网络中的计算节点的操作组的锁,包括分配操作组的根节点以发送用于锁定请求的确认,根锁管理模块包括自动计算机的模块; 从子节点接收分配给特定节点的锁请求; 确定来自另一个孩子的另一请求是否在确认队列中直接前面; 如果来自另一个孩子的请求在确认队列中直接在前面,则将特定节点的锁定请求放在确认队列中,直到满足确认队列中的前方的锁定请求为止,并且当满足队列中的锁定请求时, 向所述锁定请求分配给所述特定节点的消息的所述特定节点发送锁定; 并且如果来自另一个孩子的请求不是在队列中的直接前方,则向发送锁定请求的特定节点发送确认特定节点具有锁定的消息。