Weaviate Podcast cover image

ParlayANN with Magdalen Dobson Manohar

Weaviate Podcast

00:00

Exploring Parallel Computing in Graph-Building Algorithms

Discussion on parallelizing graph-building in approximate nearest neighbor search algorithms, focusing on reducing contention caused by locks, exploring diverse methods in the ParlayANN project, and analyzing algorithms such as disk, H, SW, HCNG, and PINDescent. Detailed examination of lock contention in the disk ANN incremental algorithm, addressing data race issues during parallel insertions, and the impact of lock determinism on graph structure.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app