
ParlayANN with Magdalen Dobson Manohar
Weaviate Podcast
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.
00:00
Transcript
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.