What is a "dreadlock"? (note the "R")

Question

I heard many times dead ends , but what is dreadlock in the context of multi-threaded programming?

Update: Answers IAbstract to a white paper that explains an algorithm called dreadlock (and not the product that seems). It fully covers this concept. However, to briefly talk about him:

A common way to detect deadlocks is to keep track of which threads are blocking resources. This basically creates a flow chart for resources, and when a cycle appears on this graph, a deadlock occurs. This method is known as a spin lock and is also known as expensive, so more effective alternatives such as simple time-out locks are also widely used. The Dreadlock algorithm seems to be the solution for the inefficiency of regular spin-lock algorithms, minimizing the amount of data needed to track lock cycles.

Answer 1

Dreadlock looks like a new product or toolkit that you can use to search for or detect deadlocks (although by the time this happens, you will be cursing a terrible dead end). (link provided by Felix Kling)

Answer 2

when a process requests a resource, and this resource is held by some other waiting process, and the process can never change its state, the situation is called a deadlock.