Locality Exists in Graph Processing Workload Characterization on an Ivy Bridge

Locality Exists in Graph Processing: Workload Characterization on an Ivy Bridge ServerScott Beamer Krste Asanović David Patterson Electrical Engineering & Computer Sciences DepartmentUniversity of California Berkeley, California{sbeamer,krste,pattrsn}@eecs.berkeley.eduAbstract—Graph processing is an increasingly important ap- plication domain and is typically communication-bound. In this work, we analyze the performance characteristics of three high- performance graph algorithm codebases using