Lines Matching refs:strong

512 Dependency types and strong dependency paths:
571 "strong" path, which indicates the strong dependency throughout each dependency
573 -(xR)-> and -(Sx)->. In other words, a "strong" path is a path from a lock
579 We will see why the path is called "strong" in next section.
588 If there is a closed strong path (i.e. a strong circle), then there is a
589 combination of locking sequences that causes deadlock. I.e. a strong circle is
594 If there is no closed strong path (i.e. strong circle), then there is no
595 combination of locking sequences that could cause deadlock. I.e.  strong
598 With these two Lemmas, we can easily say a closed strong path is both sufficient
599 and necessary for deadlocks, therefore a closed strong path is equivalent to
600 deadlock possibility. As a closed strong path stands for a dependency chain that
601 could cause deadlocks, so we call it "strong", considering there are dependency
606 Let's say we have a strong circle::
626 L2 and L2 -> L3 are not -(xR)-> and -(Sx)-> (the definition of strong), which
639 strong circle in the dependency graph.
651 , and now let's prove the circle is strong:
658 and this is true for any lock in the circle, therefore, the circle is strong.