8 March 2019 in IEEE Transactions on Computers
6 May 2025 in IEEE Journal of Solid-State Circuits
The emerging computing-in-memory (CIM) architecture shows promise in efficiently processing deep neural networks (DNNs) by minimizing the data movement through analog in-memory computing. Unfortunately, the energy efficiency of CIM is still limited since it struggles to efficiently process the massive nonlinear activation functions (AFs) widely used in DNNs. In the current solutions, AFs require to be fulfilled in the digital domain with co-processors or lookup table (LUT). Therefore, a significant amount of data requires a round-trip conversion between the analog and digital domains at each AF process. The unavoidable analog-to-digital and digital-to-analog (AD/DA) conversions dominate the system’s power consumption and reduce the overall energy efficiency. To address these issues, we propose a reconfigurable analog circuitry for nonlinear AF computation, named RAC-NAF. It is a pure analog circuitry that utilizes Taylor approximation (TA) to fit the arbitrary AFs, thereby reducing AD/DA conversions. To enhance the accuracy, RAC-NAF adopts a segmentation calculation method (SCM) based on the characteristics of nonlinear AFs. Moreover, the RAC-NAF provides the capability for reconfiguration to support various AFs and can be easily integrated with the existing CIM accelerators. The experimental results show that the proposed RAC-NAF significantly improves the performance of the CIM accelerators and reduces the energy consumption. When performing inference on various CIM accelerators, the energy consumption of AD/DA conversions can be reduced up to $12.31{\times }$ , while the overall energy efficiency can be increased by $2.34{\times }$ – $5.20{\times }$ , and the accuracy loss is below 1%.
3 November 2025 in ACM Transactions on Storage
Delta compression can complement data deduplication by further minimizing redundancy through the compression of non-duplicate data chunks. When adding delta compression to deduplication-based backup systems, however, two primary challenges arise that degrade performance of inline deduplication. First, extra I/Os are introduced along the critical paths of backup and restoration for retrieving base chunks, slowing the system. Second, rewriting techniques prohibit specific data chunks from serving as base chunks for delta compression to improve restore performance, resulting in a loss of compression efficiency. In this paper, we introduce LoopDelta, a framework that seamlessly integrates delta compression into inline deduplication for backup storage, addressing the aforementioned challenges by using three techniques: (1) dual-locality-based similarity tracking leverages both logical and physical locality to detect most of the similar chunks, which, due to their locality, can be prefetched by piggybacking on routine operations during deduplication, thereby eliminating extra I/Os during backup; (2) cache-aware filter identifies base chunks requiring extra I/Os during restore and prevents their referencing, thus eliminating extra restore I/Os; and (3) inversed delta compression, which reverses the roles of base and target chunks in the traditional delta compression approach, thereby allowing for the delta compression of data chunks that are otherwise prohibited as base chunks due to rewriting techniques. Experiments show that LoopDelta increases the compression ratio by 1.28 to 11.33 times over basic deduplication, without significantly affecting backup throughput, and enhances restore performance by up to 3.57 times.