Energy Efficient Architecture for Graph Analytics Accelerators

Citations Over TimeTop 10% of 2016 papers

Abstract

Specialized hardware accelerators can significantly improve the performance and power efficiency of compute systems. In this paper, we focus on hardware accelerators for graph analytics applications and propose a configurable architecture template that is specifically optimized for iterative vertex-centric graph applications with irregular access patterns and asymmetric convergence. The proposed architecture addresses the limitations of the existing multi-core CPU and GPU architectures for these types of applications. The SystemC-based template we provide can be customized easily for different vertex-centric applications by inserting application-level data structures and functions. After that, a cycle-accurate simulator and RTL can be generated to model the target hardware accelerators. In our experiments, we study several graph-parallel applications, and show that the hardware accelerators generated by our template can outperform a 24 core high end server CPU system by up to 3x in terms of performance. We also estimate the area requirement and power consumption of these hardware accelerators through physical-aware logic synthesis, and show up to 65x better power consumption with significantly smaller area.

Related Papers

• → S3CBench: Synthesizable Security SystemC Benchmarks for High-Level Synthesis(2017)16 cited
• → A SystemC Superset for High-Level Synthesis(2010)3 cited
• → Implementation of a C-to-SystemC synthesizer prototype(2007)2 cited
• → Object Oriented Hardware Design and Synthesis Based on SystemC 2.0(2006)7 cited
• → Concepts of high level synthesis using SystemC(2014)