Energy efficient architecture for graph analytics accelerators
dc.citation.epage | 177 | en_US |
dc.citation.spage | 166 | en_US |
dc.contributor.author | Özdal, Muhammet Mustafa | en_US |
dc.contributor.author | Yeşil, Şerif | en_US |
dc.contributor.author | Kim, T. | en_US |
dc.contributor.author | Ayupov, A. | en_US |
dc.contributor.author | Greth, J. | en_US |
dc.contributor.author | Burns, S. | en_US |
dc.contributor.author | Öztürk, Özcan | en_US |
dc.coverage.spatial | Seoul, South Korea | |
dc.date.accessioned | 2018-04-12T11:49:10Z | |
dc.date.available | 2018-04-12T11:49:10Z | |
dc.date.issued | 2016-06 | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.description | Date of Conference: 18-22 June 2016 | |
dc.description | Conference name: ACM/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA) 2016 | |
dc.description.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. © 2016 IEEE. | en_US |
dc.identifier.doi | 10.1109/ISCA.2016.24 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/37725 | en_US |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | https://doi.org/10.1109/ISCA.2016.24 | en_US |
dc.source.title | Proceedings - 43rd International Symposium on Computer Architecture, ISCA 2016 | en_US |
dc.subject | Hardware | |
dc.subject | Instruction sets | |
dc.subject | Graphics processing units | |
dc.subject | Data structures | |
dc.subject | Bandwidth | |
dc.subject | Convergence | |
dc.subject | C++ language | |
dc.subject | Computer architecture | |
dc.subject | Data structures | |
dc.subject | Graph grammars | |
dc.subject | High level synthesis | |
dc.subject | Microprocessor chips | |
dc.subject | Multiprocessing systems | |
dc.subject | Optimisation | |
dc.subject | Power aware computing | |
dc.title | Energy efficient architecture for graph analytics accelerators | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Energy Efficient Architecture for Graph Analytics Accelerators.pdf
- Size:
- 316.58 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version