Heard many times of deadlocks, but what is a dreadlock in the context of multithreaded programming?
Update: IAbstract's answer links to a whitepaper which explains the algorithm named dreadlock (not a product it seems). It covers the concept quite thoroughly. However, to briefly summarize what it's about:
A common way of detecting deadlocks is to keep track of which threads are locking which resources. This basically produces a thread-to-resource graph, and when a cycle appears in this graph a deadlock has occurred. This method is known as a spin-lock and is also known for being expensive, so more efficient alternatives like simple locking-timeouts is also commonly used. The Dreadlock algorithm seems to be a solution for the inneffectiveness in regular spin-lock algorithms, by minimizing the amount of data needed to keep track of locking cycles.
traditional locs. freeform locs. two strand twist dreads/locs. interlocking locs.
Dreadlocks are ropes of hair while twists are two strands of dreads twisted together. While both styles are roped, you can opt for twists if you're wanting dreadlocks with a more unique look.
Locs represent a devotion to purity, and since the locs are found around the head and face it acts as a constant spiritual reminder to its owner that they own force, wisdom, and are expected to generate goodness onto themselves and others. In Hindu culture Shiva was said to have “Tajaa,” twisted locs of hair.
Dreadlocks, also known as locs or dreads, are rope-like strands of hair formed by locking or braiding hair.
Dreadlock looks like a new product or toolset you can use to find or detect deadlocks (although, by the time one occurs, you will be cursing the dreaded deadlock). (link supplied by Felix Kling)
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With