A deadlock is a scenario where two (or more) ECBs are holding the resource that the other ECB is waiting for. This is also known as a "deadly embrace." An example of this scenario is illustrated below:
Now we process the second adjacent ECB and insert (0BA6, 0B10):
And then the third, (0B74, 0B10):
Since we've went through all adjacent ECBs in index 4 of the hold-wait table, we can advance to index 5 and process (0B6C, 0B11):
And finally, we process (0B7E, 0B9A) at index 6 of the hold-wait table, which results in a hash collision at index 2 of our transposed tale. We start at the index it hashed to, plus one. Index 3 is occupied, so we choose index 4 as the position for (0B7E, 0B9A). We also update index 2's synonym field:
The hold-wait table has been transposed.