会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Optimistic, eager rendezvous transmission mode and combined rendezvous modes for message processing systems
    • 乐观,快速的会合传输模式和消息处理系统的组合会合模式
    • US06178174B1
    • 2001-01-23
    • US08918390
    • 1997-08-26
    • Hubertus FrankeRama K. GovindarajuPratap C. PattnaikMandayam T. RaghunathRobert M. Straub
    • Hubertus FrankeRama K. GovindarajuPratap C. PattnaikMandayam T. RaghunathRobert M. Straub
    • H04L1254
    • H04L47/10H04L47/30
    • A method, system, and associated program code and data structures are provided for a message processing system in which messages are transmitted from source nodes to destination nodes. An “eager” rendezvous transmission mode is disclosed in which early arrival buffering is provided at message destination nodes for a predetermined amount of data for each of a predetermined number of incoming messages. Relying on the presence of the early arrival buffering at a message destination node, a message source node can send a corresponding amount of message data to the destination node along with control information in an initial transmission. Any remaining message data is sent only upon receipt by the source node of an acknowledgement from the destination node indicating that the destination node is prepared to receive any remaining data. In an enhanced embodiment, the source node alternates between rendezvous transmission modes as a function of the amount of free space in the early arrival buffering at the destination node, as indicated by the number of outstanding initial transmissions for which acknowledgements have not yet been received. Different transmission modes for different destination nodes can be employed at a source node, depending on the amount of early arrival buffering currently available in each respective destination node.
    • 提供了一种消息处理系统的方法,系统和相关联的程序代码和数据结构,其中消息从源节点传送到目的地节点。 公开了一种“急切的”会合传输模式,其中针对预定数量的进入消息中的每一个为预定量的数据在消息目的地节点处提供早到达缓冲。 依赖于在消息目的地节点处的早期到达缓冲的存在,消息源节点可以在初始传输中与控制信息一起向目的地节点发送相应量的消息数据。 任何剩余的消息数据仅在源节点收到来自目的地节点的确认时发送,指示目的地节点准备接收任何剩余数据。 在增强实施例中,源节点在集合传输模式之间交替,作为在目的地节点处的早到达缓冲中的可用空间量的函数,如尚未被接收到确认的未完成初始传输的数量所指示的。 根据当前在每个相应目的地节点中可用的早到达缓冲的数量,可以在源节点采用用于不同目的地节点的不同传输模式。
    • 3. 发明授权
    • Seamless interface for multi-threaded core accelerators
    • 多线程核心加速器的无缝界面
    • US08683175B2
    • 2014-03-25
    • US13048214
    • 2011-03-15
    • Kattamuri EkanadhamHung Q. LeJose E. MoreiraPratap C. Pattnaik
    • Kattamuri EkanadhamHung Q. LeJose E. MoreiraPratap C. Pattnaik
    • G06F9/30G06F12/10
    • G06F9/3877G06F9/30043G06F9/3012G06F9/30123G06F9/3851G06F12/1027
    • A method, system and computer program product are disclosed for interfacing between a multi-threaded processing core and an accelerator. In one embodiment, the method comprises copying from the processing core to the hardware accelerator memory address translations for each of multiple threads operating on the processing core, and simultaneously storing on the hardware accelerator one or more of the memory address translations for each of the threads. Whenever any one of the multiple threads operating on the processing core instructs the hardware accelerator to perform a specified operation, the hardware accelerator has stored thereon one or more of the memory address translations for the any one of the threads. This facilitates starting that specified operation without memory translation faults. In an embodiment, the copying includes, each time one of the memory address translations is updated on the processing core, copying the updated one of the memory address translations to the hardware accelerator.
    • 公开了用于在多线程处理核心和加速器之间进行接口的方法,系统和计算机程序产品。 在一个实施例中,该方法包括从处理核心复制到在处理核心上操作的多个线程中的每个线程的硬件加速器存储器地址转换,以及同时在硬件加速器上存储每个线程的一个或多个存储器地址转换 。 只要在处理核心上操作的多个线程中的任何一个指示硬件加速器执行指定的操作,则硬件加速器在其上存储有针对任何一个线程的一个或多个存储器地址转换。 这有助于启动指定的操作,而不会出现内存转换错误。 在一个实施例中,复制包括每次在处理核心上更新一个存储器地址转换时,将更新的一个存储器地址转换复制到硬件加速器。
    • 7. 发明申请
    • BRANCH TARGET PREDICTION FOR MULTI-TARGET BRANCHES BY IDENTIFYING A REPEATED PATTERN
    • 通过识别重复图案来分支多目标分支的目标预测
    • US20080288760A1
    • 2008-11-20
    • US12183995
    • 2008-07-31
    • Il ParkPratap C. PattnaikJong-Deok Choi
    • Il ParkPratap C. PattnaikJong-Deok Choi
    • G06F9/38
    • G06F9/3844G06F9/30061G06F9/324
    • An information processing system for branch target prediction includes: a first memory for storing entries for multi-target branch, wherein each entry includes a plurality of target addresses representing a history of target addresses for each single branch in the multi-target branch, and wherein said first memory stores an entry for the branch only if the branch is a multi-target branch; hardware logic for reading the memory and identifying a repeated pattern in each of the plurality of target addresses for the multi-target branch; logic for predicting a next target address for the multi-target branch based on the repeated pattern that was identified, using a pattern matching algorithm; and a second memory for storing information regarding whether a branch is a multi-target branch; wherein the logic for reading and the logic for predicting are executed only if the branch is the multi-target branch.
    • 用于分支目标预测的信息处理系统包括:用于存储多目标分支的条目的第一存储器,其中每个条目包括表示多目标分支中的每个单个分支的目标地址的历史的多个目标地址,并且其中 所述第一存储器仅在所述分支是多目标分支时存储所述分支的条目; 用于读取存储器并识别用于多目标分支的多个目标地址中的每一个中的重复模式的硬件逻辑; 基于使用模式匹配算法识别的重复模式来预测多目标分支的下一目标地址的逻辑; 以及第二存储器,用于存储关于分支是否是多目标分支的信息; 其中仅当分支是多目标分支时才执行用于读取的逻辑和用于预测的逻辑。
    • 8. 发明授权
    • Optimistic, eager rendezvous transmission system and combined rendezvous
system for message processing, and related data structures
    • 乐观,快速的会合传输系统和消息处理的组合会合系统及相关数据结构
    • US06035335A
    • 2000-03-07
    • US917571
    • 1997-08-26
    • Hubertus FrankeRama K. GovindarajuPratap C. PattnaikMandayam T. RaghunathRobert M. Straub
    • Hubertus FrankeRama K. GovindarajuPratap C. PattnaikMandayam T. RaghunathRobert M. Straub
    • G06F13/00
    • G06F13/36
    • A method, system, and associated program code and data structures are provided for a message processing system in which messages are transmitted from source nodes to destination nodes. An "eager" rendezvous transmission mode is disclosed in which early arrival buffering is provided at message destination nodes for a predetermined amount of data for each of a predetermined number of incoming messages. Relying on the presence of the early arrival buffering at a message destination node, a message source node can send a corresponding amount of message data to the destination node along with control information in an initial transmission. Any remaining message data is sent only upon receipt by the source node of an acknowledgement from the destination node indicating that the destination node is prepared to receive any remaining data. In an enhanced embodiment, the source node alternates between rendezvous transmission modes as a function of the amount of free space in the early arrival buffering at the destination node, as indicated by the number of outstanding initial transmissions for which acknowledgements have not yet been received. Different transmission modes for different destination nodes can be employed at a source node, depending on the amount of early arrival buffering currently available in each respective destination node.
    • 提供了一种消息处理系统的方法,系统和相关联的程序代码和数据结构,其中消息从源节点传送到目的地节点。 公开了一种“急切的”会合传输模式,其中针对预定数量的进入消息中的每一个为预定量的数据在消息目的地节点处提供早到达缓冲。 依赖于在消息目的地节点处的早期到达缓冲的存在,消息源节点可以在初始传输中与控制信息一起向目的地节点发送相应量的消息数据。 任何剩余的消息数据仅在源节点收到来自目的地节点的确认时发送,指示目的地节点准备接收任何剩余数据。 在增强实施例中,源节点在集合传输模式之间交替,作为在目的地节点处的早到达缓冲中的可用空间量的函数,如尚未被接收到确认的未完成初始传输的数量所指示的。 根据当前在每个相应目的地节点中可用的早到达缓冲的数量,可以在源节点采用用于不同目的地节点的不同传输模式。