中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

5 records (took 0.022 seconds)

    MESSAGE COMMUNICATION TECHNIQUES
    1.
    发明申请
    MESSAGE COMMUNICATION TECHNIQUES 审中-公开
    消息通信技术

    公开(公告)号：WO2010078010A2

    公开(公告)日：2010-07-08

    申请号：PCT/US2009068396

    申请日：2009-12-17

    Applicant: INTEL CORP ,  KING STEVEN ,  HUGGAHALLI RAM ,  ZHU XIA ,  MEMON MAZHAR ,  BERRY FRANK ,  BHARDWAI NITIN ,  KUMAR AMIT ,  WILLKE THEODORE II

    Inventor： KING STEVEN ,  HUGGAHALLI RAM ,  ZHU XIA ,  MEMON MAZHAR ,  BERRY FRANK ,  BHARDWAI NITIN ,  KUMAR AMIT ,  WILLKE THEODORE II

    IPC: H04L29/06 ,  H04L12/58

    CPC classification number: G06F9/455 ,  G06F9/546 ,  H04L29/06 ,  H04L51/00

    Abstract: A network protocol unit interface is described that uses a message engine to transfer contents of received network protocol units in message segments to a destination message engine. The network protocol unit interface uses a message engine to receive messages whose content is to be transmitted in network protocol units. A message engine transmits message segments to a destination message engine without the message engine transmitter and receiver sharing memory space. In addition, the transmitter message engine can transmit message segments to a receiver message engine by use of a virtual address associated with the receiver message and a queue identifier, as opposed to a memory address.

    Abstract translation: 描述了使用消息引擎将消息段中的接收的网络协议单元的内容传送到目的地消息引擎的网络协议单元接口。 网络协议单元接口使用消息引擎来接收其内容将以网络协议单元传输的消息。 消息引擎将消息段发送到目的地消息引擎，而消息引擎发送器和接收器共享存储器空间。 此外，与存储器地址相反，发射机消息引擎可以通过使用与接收器消息相关联的虚拟地址和队列标识符将消息段发送到接收器消息引擎。

    GRAPH OPERATIONS
    4.
    发明公开
    GRAPH OPERATIONS 审中-公开

    公开(公告)号：EP3238101A4

    公开(公告)日：2018-06-06

    申请号：EP15873864

    申请日：2015-10-07

    Applicant: INTEL CORP

    Inventor： LISONBEE TODD ,  KAVULYA SOILA P ,  KELLER BRYN ,  BARKER BRITON L ,  DATTA KUSHAL ,  ZHU XIA ,  WILLKE THEODORE L

    IPC: G06F17/30

    CPC classification number: G06F17/30958

    Abstract: A system and method for orchestrating a table operation of data with a graph operation of the data using columnar stores. The orchestration includes storing vertices and edges as collections of tables by type, and supporting the columnar stores with different storage characteristics. The techniques may also include a graph query optimizer that combines chained operators of a graph query; and/or the graph query executed via an in-memory distributed query execution engine.

    ASSIGNING GLOBAL EDGE IDS FOR EVOLVING GRAPHS
    5.
    发明公开
    ASSIGNING GLOBAL EDGE IDS FOR EVOLVING GRAPHS 审中-公开

    公开(公告)号：EP3238092A4

    公开(公告)日：2018-05-30

    申请号：EP15873884

    申请日：2015-10-12

    Applicant: INTEL CORP

    Inventor： ZHU XIA ,  WILLKE THEODORE L ,  KELLER BRYN ,  CHEN SHIH-CHI ,  DATTA KUSHAL

    IPC: G06F17/30

    CPC classification number: G06F17/30958

    Abstract: A method, computing system, and computer-readable medium for assigning global edge IDs for evolving graphs are described herein. The method includes selecting a block size for an evolving graph and, as new vertices are added to the evolving graph, calculating block IDs for the evolving graph. Calculating the block IDs includes creating a table representing the evolving graph and, as new vertices are added to the evolving graph, calculating block IDs for cells in a new column of the table before calculating block IDs for cells in a new row of the table. The method also includes calculating global edge IDs for the evolving graph based on the source vertex ID, the target vertex ID, and the block ID for the block at which each edge is located. The method may also include calculating incremental Page Rank for the evolving graph.

Patent Agency Ranking