TY - GEN
T1 - Space-efficient Graph Data Placement to Save Energy of ReRAM Crossbar
AU - Lo, Ting Shan
AU - Wu, Chun Feng
AU - Chang, Yuan Hao
AU - Kuo, Tei Wei
AU - Wang, Wei Chen
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/7/26
Y1 - 2021/7/26
N2 - Aiming to extract the information behind messy data, graph computation is one of the popular big data analysis applications. During running graph computation, large numbers of vertices and edges will be moved between memory and computing units, and these intensive data movements lead to a performance bottleneck. To break the bottleneck, Resistive Random-Access Memory (ReRAM) based crossbar accelerators, which can act as both computing and memory units simultaneously on one chip, are a promising solution to eliminate these data movements. However, running graph computation on crossbar accelerators incurs high power consumption because real-world graphs are too sparse and discrete to unleash the computation capability provided by crossbar accelerators. In contrast to previous works which require extra general-purpose computing units to work with crossbar accelerators, this work proposes a software strategy, called graph-aware crossbar placement strategy, to improve the utilization of crossbar accelerators by clustering graph nodes with strong graph spatial locality. The evaluation results show that the proposed graph-aware crossbar placement strategy can efficiently save the energy consumption of crossbar accelerators.
AB - Aiming to extract the information behind messy data, graph computation is one of the popular big data analysis applications. During running graph computation, large numbers of vertices and edges will be moved between memory and computing units, and these intensive data movements lead to a performance bottleneck. To break the bottleneck, Resistive Random-Access Memory (ReRAM) based crossbar accelerators, which can act as both computing and memory units simultaneously on one chip, are a promising solution to eliminate these data movements. However, running graph computation on crossbar accelerators incurs high power consumption because real-world graphs are too sparse and discrete to unleash the computation capability provided by crossbar accelerators. In contrast to previous works which require extra general-purpose computing units to work with crossbar accelerators, this work proposes a software strategy, called graph-aware crossbar placement strategy, to improve the utilization of crossbar accelerators by clustering graph nodes with strong graph spatial locality. The evaluation results show that the proposed graph-aware crossbar placement strategy can efficiently save the energy consumption of crossbar accelerators.
UR - http://www.scopus.com/inward/record.url?scp=85114365362&partnerID=8YFLogxK
U2 - 10.1109/ISLPED52811.2021.9502482
DO - 10.1109/ISLPED52811.2021.9502482
M3 - Conference contribution
AN - SCOPUS:85114365362
T3 - Proceedings of the International Symposium on Low Power Electronics and Design
BT - 2021 IEEE/ACM International Symposium on Low Power Electronics and Design, ISLPED 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE/ACM International Symposium on Low Power Electronics and Design, ISLPED 2021
Y2 - 26 July 2021 through 28 July 2021
ER -