Hi, I am reading section 6.5.4, there is one paragraph said: > The fraction of cells visited by PWQ is similar to that of SEQ. In addition, PWQ’s solution time is greater than that of PART, even for equal visit fractions. The reason for this is shown in Figure 6.28, which has a red circle on > Figure 6.29: Effect of Compiler Optimization (-O3) > each cell with more than two neighbors. Each such cell can result in contention in PWQ, because one thread can enter but two threads can exit, which hurts performance, I don't know why there is competition only when a cell has more than two neighbors? And as the subject said, what does "one thread can enter but two threads can exit” mean? After checking the code(maze_fg.c), Doesn’t every cell in the maze can result in contention? Thanks, Alan
