Cambricon-U: A Systolic Random Increment Memory Architecture for Unary Computing

3Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Unary computing, whose arithmetics require only one logic gate, has enabled efficient DNN processing, especially on strictly power-constrained devices. However, unary computing still confronts the power efficiency bottleneck for buffering unary bitstreams. The buffering of unary bitstreams requires accumulating bits into large bitwidth binary numbers. The large bitwidth binary number needs to activate all bits per cycle in case of carry propagation. As a result, the accumulation process accounts for 32%-70% of the power budget. To push the boundary of power efficiency, we propose Cambricon-U, a systolic random increment memory architecture featuring efficient accumulation. By leveraging skew number data format, Cambricon-U only activates no more than three bits (instead of all bits) from each number per accumulating cycle. Experimental results show that Cambricon-U reduces 51% power on unary accumulation, and improves 1.18-1.45 × energy efficiency over uSystolic, the SOTA unary computing scheme baseline, with -1.9% ∼+0.77% area overhead.

Cite

CITATION STYLE

APA

Guo, H., Zhao, Y., Li, Z., Hao, Y., Liu, C., Song, X., … Xu, Z. (2023). Cambricon-U: A Systolic Random Increment Memory Architecture for Unary Computing. In Proceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 2023 (pp. 424–437). Association for Computing Machinery, Inc. https://doi.org/10.1145/3613424.3614286

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free