Here, throughput is about the same as graph size increases. This is because of the re-ordering of the computation in the graph. If we were doing the original random bouncing around memory access, the throughput would go to zero as the graph size increases.
Here, throughput is about the same as graph size increases. This is because of the re-ordering of the computation in the graph. If we were doing the original random bouncing around memory access, the throughput would go to zero as the graph size increases.