3min snip

Weaviate Podcast cover image

ParlayANN with Magdalen Dobson Manohar

Weaviate Podcast

NOTE

Understanding Lock Contention and Determinism in Graph Algorithms

Lock contention arises when multiple threads share a resource, and one thread locks it, preventing others from accessing it. This can lead to undefined behavior in parallel processing due to data races. To address this, locks are used to control access and modification of shared data. However, in languages like C++, indeterminism can occur when multiple processes try to access the same data simultaneously. In graph algorithms like diskANN, indeterminism in lock acquisition can impact the order of vertex insertion, affecting the graph structure and leading to non-deterministic outcomes.

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