16420

Near Memory Similarity Search on Automata Processors

Vincent T. Lee, Justin Kotalik, Carlo C. Del Mundo, Armin Alaghi, Luis Ceze, Mark Oskin
University of Washington
arXiv:1608.03175 [cs.DC], (9 Aug 2016)

@article{lee2016near,

   title={Near Memory Similarity Search on Automata Processors},

   author={Lee, Vincent T. and Kotalik, Justin and Mundo, Carlo C. Del and Alaghi, Armin and Ceze, Luis and Oskin, Mark},

   year={2016},

   month={aug},

   archivePrefix={"arXiv"},

   primaryClass={cs.DC}

}

Download Download (PDF)   View View   Source Source   

512

views

Embedded devices and multimedia applications today generate unprecedented volumes of data which must be indexed and made searchable. As a result, similarity search has become a critical idiom for many modern data intensive applications in natural language processing (NLP), vision, and robotics. At its core, similarity search is implemented using k-nearest neighbors (kNN) where computation consists of highly parallel distance calculations and a global top-k sort. In contemporary von-Neumann architectures, kNN is bottlenecked by data movement limiting throughput and latency.
Rating: 2.1. From 29 votes.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: