EFFICIENT USAGE OF ONE-SIDED RDMA FOR LINEAR PROBING

    公开(公告)号:US20210390075A1

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

    申请号:US17176856

    申请日:2021-02-16

    IPC分类号: G06F15/173 G06F16/2453

    摘要: 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

    公开(公告)号:US11966356B2

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

    申请号:US18088353

    申请日:2022-12-23

    摘要: 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

    公开(公告)号:US11720522B2

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

    申请号:US17176856

    申请日:2021-02-16

    IPC分类号: G06F16/245 G06F15/173

    CPC分类号: G06F15/17331 G06F16/245

    摘要: 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

    公开(公告)号:US20230127110A1

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

    申请号:US18088353

    申请日:2022-12-23

    IPC分类号: G06F15/173 G06F16/245

    摘要: 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.