This figure plots observed end-to-end response times at the 99th percentile (near worst-case behavior), normalized by graph depth times period, for graphs with increasingly heavy data working set sizes. The “WF” lines depict observations for “worst-fit” assignment of graph nodes to CPU clusters, which evenly distributes work across clusters. “CA” lines depict observations for “cache-aware” cluster assignment, where related nodes are assigned to the same, or adjacent, clusters in an effort to promote cache reuse. Response times are shorter (better) under CA, provided that the cache is not overly utilized. WF performs better under heavy cache use since there is increased cache contention, and it become more important to distribute work among clusters.