The unintentional result is known as false contention. This unfortunate situation occurs when two processes require access to different memory pieces, yet both memory pieces are controlled by the same latch. Figure 3-14 shows an example of false contention. Process P100 requires access memory structure MS1. Process P200 requires access to memory structure MS2. A single latch CS999 controls access to both memory structures MS1 and MS2. If process P100 has latch CS999 while accessing MS1, process P200 will contend for the latch, even though it has no need to access memory structure MS1! Because the processes are contending for the same control structure, yet will not access the same memory structure, they are falsely contending. The more complex the underlying memory structure, the more likely this will occur.

Figure 3-14. An example of false contention. If process P100 wants access to memory structure MS1 and process P200 wants access to memory structure MS2, they will both contend for the same control structure CS999, resulting in false contention.

Another consequence associated with false contention is control structure contention. For example, suppose you want to build a shed to store farm equipment, but you must first obtain a permit. Many other people also want to build sheds, so the governmental office is overwhelmed with permit requests. To ensure there is no illegal builder collaboration, each permit is serially reviewed. As you can imagine, during peak permit submission times, the permit review process can experience long delays. In this situation, acquiring the permit is the bottleneck, not shed construction.