中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

8 records (took 0.015 seconds)

    Remote direct memory operations (RDMOs) for transactional processing systems
    1.
    发明授权
    Remote direct memory operations (RDMOs) for transactional processing systems 有权

    公开(公告)号：US10977193B2

    公开(公告)日：2021-04-13

    申请号：US16542222

    申请日：2019-08-15

    Applicant: Oracle International Corporation

    Inventor： Hideaki Kimura ,  Garret F. Swart ,  Spyros Blanas

    IPC: G06F13/00 ,  G06F12/1081 ,  G06F16/23

    Abstract: Techniques are described for offloading remote direct memory operations (RDMOs) to “execution candidates”. The execution candidates may be any hardware capable of performing the offloaded operation. Thus, the execution candidates may be network interface controllers, specialized co-processors, FPGAs, etc. The execution candidates may be on a machine that is remote from the processor that is offloading the operation, or may be on the same machine as the processor that is offloading the operation. Details for certain specific RDMOs, which are particularly useful in online transaction processing (OLTP) and hybrid transactional/analytical (HTAP) workloads, are provided.

    EFFICIENT USAGE OF ONE-SIDED RDMA FOR LINEAR PROBING
    2.
    发明申请
    EFFICIENT USAGE OF ONE-SIDED RDMA FOR LINEAR PROBING 有权

    公开(公告)号：US20210390075A1

    公开(公告)日：2021-12-16

    申请号：US17176856

    申请日：2021-02-16

    Applicant: Oracle International Corporation

    Inventor： Tinggang Wang ,  Shuo Yang ,  Hideaki Kimura ,  Garret F. Swart ,  Spyros Blanas

    IPC: G06F15/173 ,  G06F16/2453

    Abstract: Systems and methods for reducing latency of probing operations of remotely located linear hash tables are described herein. In an embodiment, a system receives a request to perform a probing operation on a remotely located linear hash table based on a key value. Prior to performing the probing operation, the system dynamically predicts a number of slots for a single read of the linear hash table to minimize total cost for an average probing operation. The system determines a hash value based on the key value and determines a slot of the linear hash table to which the hash value corresponds. After predicting the number of slots, the system issues an RDMA request to perform a read of the predicted number of slots from the linear hash table starting at the slot to which the hash value corresponds.

    REMOTE DIRECT MEMORY OPERATIONS (RDMOS) FOR TRANSACTIONAL PROCESSING SYSTEMS
    3.
    发明申请
    REMOTE DIRECT MEMORY OPERATIONS (RDMOS) FOR TRANSACTIONAL PROCESSING SYSTEMS 审中-公开

    公开(公告)号：US20200057731A1

    公开(公告)日：2020-02-20

    申请号：US16542222

    申请日：2019-08-15

    Applicant: Oracle International Corporation

    Inventor： Hideaki Kimura ,  Garret F. Swart ,  Spyros Blanas

    IPC: G06F12/1081 ,  G06F16/23

    Abstract: Techniques are described for offloading remote direct memory operations (RDMOs) to “execution candidates”. The execution candidates may be any hardware capable of performing the offloaded operation. Thus, the execution candidates may be network interface controllers, specialized co-processors, FPGAs, etc. The execution candidates may be on a machine that is remote from the processor that is offloading the operation, or may be on the same machine as the processor that is offloading the operation. Details for certain specific RDMOs, which are particularly useful in online transaction processing (OLTP) and hybrid transactional/analytical (HTAP) workloads, are provided.

    Efficient usage of one-sided RDMA for linear probing
    4.
    发明授权
    Efficient usage of one-sided RDMA for linear probing 有权

    公开(公告)号：US11966356B2

    公开(公告)日：2024-04-23

    申请号：US18088353

    申请日：2022-12-23

    Applicant: Oracle International Corporation

    Inventor： Tinggang Wang ,  Shuo Yang ,  Hideaki Kimura ,  Garret F. Swart ,  Spyros Blanas

    IPC: G06F16/245 ,  G06F15/173 ,  G06F16/2455

    CPC classification number: G06F15/17331 ,  G06F16/245 ,  G06F16/2455

    Abstract: Systems and methods for reducing latency of probing operations of remotely located linear hash tables are described herein. In an embodiment, a system receives a request to perform a probing operation on a remotely located linear hash table based on a key value. Prior to performing the probing operation, the system dynamically predicts a number of slots for a single read of the linear hash table to minimize total cost for an average probing operation. The system determines a hash value based on the key value and determines a slot of the linear hash table to which the hash value corresponds. After predicting the number of slots, the system issues an RDMA request to perform a read of the predicted number of slots from the linear hash table starting at the slot to which the hash value corresponds.

    Efficient usage of one-sided RDMA for linear probing
    6.
    发明授权
    Efficient usage of one-sided RDMA for linear probing 有权

    公开(公告)号：US11720522B2

    公开(公告)日：2023-08-08

    申请号：US17176856

    申请日：2021-02-16

    Applicant: Oracle International Corporation

    Inventor： Tinggang Wang ,  Shuo Yang ,  Hideaki Kimura ,  Garret F. Swart ,  Spyros Blanas

    IPC: G06F16/245 ,  G06F15/173

    CPC classification number: G06F15/17331 ,  G06F16/245

    Abstract: Systems and methods for reducing latency of probing operations of remotely located linear hash tables are described herein. In an embodiment, a system receives a request to perform a probing operation on a remotely located linear hash table based on a key value. Prior to performing the probing operation, the system dynamically predicts a number of slots for a single read of the linear hash table to minimize total cost for an average probing operation. The system determines a hash value based on the key value and determines a slot of the linear hash table to which the hash value corresponds. After predicting the number of slots, the system issues an RDMA request to perform a read of the predicted number of slots from the linear hash table starting at the slot to which the hash value corresponds.

    EFFICIENT USAGE OF ONE-SIDED RDMA FOR LINEAR PROBING
    7.
    发明申请
    EFFICIENT USAGE OF ONE-SIDED RDMA FOR LINEAR PROBING 有权

    公开(公告)号：US20230127110A1

    公开(公告)日：2023-04-27

    申请号：US18088353

    申请日：2022-12-23

    Applicant: Oracle International Corporation

    Inventor： Tinggang Wang ,  Shuo Yang ,  Hideaki Kimura ,  Garret F. Swart ,  Spyros Blanas

    IPC: G06F15/173 ,  G06F16/245

    Abstract: Systems and methods for reducing latency of probing operations of remotely located linear hash tables are described herein. In an embodiment, a system receives a request to perform a probing operation on a remotely located linear hash table based on a key value. Prior to performing the probing operation, the system dynamically predicts a number of slots for a single read of the linear hash table to minimize total cost for an average probing operation. The system determines a hash value based on the key value and determines a slot of the linear hash table to which the hash value corresponds. After predicting the number of slots, the system issues an RDMA request to perform a read of the predicted number of slots from the linear hash table starting at the slot to which the hash value corresponds.

Patent Agency Ranking