In this section we consider the problem of detecting races in programs whose task graphs have a two-dimensional lattice structure.
we apply the algorithm for finding suprema from Section 3 in an efficient race detection algorithm.