No
Yes
View More
View Less
Working...
Close
OK
Cancel
Confirm
System Message
Delete
Schedule
An unknown error has occurred and your request could not be completed. Please contact support.
Scheduled
Wait Listed
Personal Calendar
Speaking
Conference Event
Meeting
Interest
Schedule TBD
Conflict Found
This session is already scheduled at another time. Would you like to...
Loading...
Please enter a maximum of {0} characters.
Please enter a maximum of {0} words.
must be 50 characters or less.
must be 40 characters or less.
Session Summary
We were unable to load the map image.
This has not yet been assigned to a map.
Search Catalog
Reply
Replies ()
Search
New Post
Microblog
Microblog Thread
Post Reply
Post
Your session timed out.
This web page is not optimized for viewing on a mobile device. Visit this site in a desktop browser to access the full set of features.
2017 GTC San Jose

S7112 - Optimizing Out-of-Core Nearest Neighbor Problems on Multi-GPU Systems Using NVLINK

Session Speakers
Session Description

We'll discuss approaches for accelerating out-of-core nearest neighbor computation on multi-GPU systems using various system features such as NVLink. Nearest neighbor calculations operate over a set of high-dimensional vectors and compute pair-wise distances using certain similarity metrics such as cosine or maxNorm distances. In practice, the number of vectors can be very large and can have very high dimension (for example, 5 million 1,000 vectors for the Wikipedia corpus). In such cases, the data cannot fit the GPU device memory, and needs to be fetched from the host memory. We'll present GPU implementations of key nearest neighbor algorithms (for example, locality sensitive hashing) for these scenarios and demonstrate how one can use NVLink for optimizing these algorithms.


Additional Session Information
All
Talk
Algorithms Deep Learning and AI
Software
25 minutes
Session Schedule