首页>
外国专利>
METHOD FOR APPROXIMATE K-NEAREST-NEIGHBOR SEARCH ON PARALLEL HARDWARE ACCELERATORS
METHOD FOR APPROXIMATE K-NEAREST-NEIGHBOR SEARCH ON PARALLEL HARDWARE ACCELERATORS
展开▼
机译:并行硬件加速器上近似K-近邻-近邻搜索的方法
展开▼
页面导航
摘要
著录项
相似文献
摘要
In one embodiment, a processor of a computing device receives a query. The computing device may compare a centroid of each of a plurality of clusters to the query such that a subset of the plurality of clusters is selected, each of the plurality of clusters having a set of data points. An assignment of the subset of the plurality of clusters may be communicated to a hardware accelerator of the computing device. A plurality of threads of the hardware accelerator of the computing device may generate one or more distance tables that store results of intermediate computations corresponding to the query and the subset of the plurality of clusters. The distance tables may be stored in shared memory of the hardware accelerator. A plurality of threads of the hardware accelerator may determine a plurality of data points using the distance tables. The processor may provide query results pertaining to at least a portion of the plurality of data points.
展开▼