Accelerating graph analysis by in-memory computing
Graph algorithms often spend more time moving data than processing it. Our accelerators address this bottleneck by performing graph computation directly in resistive memory arrays. They keep the graph in its compact representation as it moves to the crossbars and reuse the same configurations for recurring connection patterns