AxBy: Approximate Computation Bypass for Data-Intensive Applications

Recent years have witnessed a rapid growth of data intensive applications such as machine learning and multimedia applications. However, such applications incur a heavy computation workload that stresses the existing computing systems, especially resource-constrained embedded systems. This paper is inspired by the key observation that many data-intensive applications naturally present a strong existence of trivial computations a set of computations the results of which can he determined without actual computations. Typical examples include multiplication with 0, +1/-1 and addition with 0. Correspondingly, we develop and implement bypass circuits that are tightly integrated with computation units to detect and bypass the trivial computations. Once detected, the circuit delivers the pre-determined result without an actual computation. We implement bypass circuits in both hardware (Verilog) and software (C). Furthermore, we enhance the opportunities of computation bypass by developing By, an approximate computation bypass method with pattern matching under limited data precision. This reconfigurability is key to achieving a "controllable approximation" and a tunable quality-energy tradeoff. Our experimental results show that for four image processing applications and three neural network applications, the computation bypass can enable 15% - 55% in image processing and 30% - 35% in neural networks of energy saving without any accuracy loss. For neural networks, we can further achieve 36% - 44% energy saving with negligible accuracy loss.