6min chapter

Weaviate Podcast cover image

ParlayANN with Magdalen Dobson Manohar

Weaviate Podcast

CHAPTER

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

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode