Parallel Hash Search

Parallel Hash Search is a parallel search method that employs distributed hash tables and concurrent probing to accelerate the lookup of keys across shared or distributed memory architectures by exploiting data-level parallelism.

7

Publications

276

Citations

22

Authors

13

Institutions

Publications per year

2017–2026

4

Authors

22

  1. AB
    Aydın Buluç

    Lawrence Berkeley National Laboratory, United States

    1 publications · 42 citations

    1

    h-index

  2. VR
    Venkat Reddy Ginjala

    Research Centre Imarat, India

    1 publications · 12 citations

    1

    h-index

  3. XS
    Xiaoye Sherry Li

    Lawrence Berkeley National Laboratory, United States

    1 publications · 42 citations

    1

    h-index

  4. YK
    Yoshikazu Kobayashi

    Nihon University, Japan

    1 publications · 15 citations

    1

    h-index

  5. FP
    Fong Pong

    University of Louisiana at Lafayette, United States

    1 publications · 15 citations

    1

    h-index

1–5 of 22

Venues

  1. 1

    h-index

  2. 1

    h-index

  3. IEEE/ACM Transactions on Networking

    TON · 1 publications · 15 citations

    1

    h-index

  4. Journal of Parallel and Distributed Computing

    1 publications · 11 citations

1–4