公开(公告)号：US20210318805A1

公开(公告)日：2021-10-14

申请号：US17358222

申请日：2021-06-25

Applicant: Intel Corporation

Inventor： Sourabh DONGAONKAR ,  Jawad B. KHAN ,  Chetan CHAUHAN ,  Dipanjan SENGUPTA ,  Mariano TEPPER ,  Theodore WILLKE

IPC: G06F3/06 ,  G06K9/62

Abstract: Binary sparse encoding of data can be used to reduce an amount of data read from the stochastic associative memory while processing a query. Read performance of the stochastic associated memory is optimized to enhance the query throughput by modifying access patterns to reduce the time to read the stochastic associated memory. Read performance of the stochastic associative memory can be further improved through the use of cluster aware sharding and replication for parallelized similarity search. Clusters are partitioned across multiple Dual In-line Memory Modules (DIMMs), each DIMM including stochastic associative memory, to achieve maximum latency advantage.

公开(公告)号：US20210224267A1

公开(公告)日：2021-07-22

申请号：US17227045

申请日：2021-04-09

Applicant: Intel Corporation

Inventor： Sourabh DONGAONKAR ,  Jawad B. KHAN ,  Chetan CHAUHAN ,  Dipanjan SENGUPTA ,  Mariano TEPPER ,  Theodore WILLKE ,  Richard L. COULSON

IPC: G06F16/2458 ,  G06F16/248 ,  G06F16/21 ,  G06F16/22 ,  G06N7/00

Abstract: Technologies for tuning performance and/or accuracy of similarity search using stochastic associative memories (SAM). Under a first subsampling approach, columns associated with set bits in a search key comprising a binary bit vector are subsampled. Matching set bits for the subsampled columns are aggregated on a row-wise basis to generate similarity scores, which are then ranked. A similar scheme is applied for all the columns with set bits in the search key and the results for top ranked rows are compared to evaluate a tradeoff between throughput boost versus lost accuracy. A second approach called continuous column read, and iterative approach is employed that continuously scores the rows as each new column read is complete. The similarity scores for an N-1 and Nth-1 iteration are ranked, a rank correlation is calculated, and a determination is made to whether the rank correlation meets or exceeds a threshold.