Siqing Fu

Siqing Fu

Auto-generated profile, based on publicly available information

Siqing Fu

College of Computer Science and Technology, National University of Defense Technology, Changsha, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 August 2023 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
SFSiqing Fu
Siqing Fu
TLTiejun Li
Tiejun Li
CZChunyuan Zhang
Chunyuan Zhang
HLHanqing Li
Hanqing Li
SMSheng Ma
Sheng Ma
LWLizhou Wu
Lizhou Wu
High-quality random numbers are very critical to many fields such as cryptography, finance, and scientific simulation, which calls for the design of reliable true random number generators (TRNGs). Limited by entropy source, throughput, reliability, and system integration, existing TRNG designs are difficult to be deployed in real computing systems to greatly accelerate target applications. This study proposes a TRNG circuit named resilient high-speed (RHS)-TRNG based on spin-transfer torque magnetic tunnel junction (STT-MTJ). RHS-TRNG generates resilient and high-speed random bit sequences exploiting the stochastic switching characteristics of STT-MTJ. By circuit/system codesign, we integrate RHS-TRNG into a reduced instruction set computer-V (RISC-V) processor as an acceleration component, which is driven by customized random number generation instructions. Our experimental results show that a single cell of RHS-TRNG has a random bit generation speed of up to 303 Mb/s, which is the highest among existing MTJ-based TRNGs. Higher throughput can be achieved by exploiting cell-level parallelism. RHS-TRNG also shows strong resilience against PVT variations thanks to our designs using bidirectional switching currents and dual generator units. In addition, our system evaluation results using gem5 simulator suggest that the system equipped with RHS-TRNG can achieve 3.4–12 $\times$ higher performance in speeding up option pricing programs than software implementations of random number generation.

3 November 2026 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
HLHanqing Li
Hanqing Li
TLTiejun Li
Tiejun Li
SMSheng Ma
Sheng Ma
JZJianmin Zhang
Jianmin Zhang
YTYuhan Tang
Yuhan Tang
LWLizhou Wu
Lizhou Wu
AI workloads increasingly demand high parallelism and efficient on-chip memory utilization on modern GPUs. However, the limited capacity of shared memory often constrains thread-level parallelism, while portions of the L2 cache remain underutilized. In this work, we propose SAI , a mechanism that virtualizes shared memory into the L2 cache to improve GPU performance for AI applications. SAI dynamically activates virtualization based on runtime resource usage, enabling additional CTAs with minimal architectural modifications. We further introduce an L2 cache management strategy that integrates associativity-based virtual page allocation and a replacement information table, reducing page-swapping overhead while preserving L2 cache performance. Experimental results demonstrate that SAI achieves an 18.6% performance improvement over the baseline design and outperforms SMILE-opt, our reproduced state-of-the-art baseline, by 8.8%. Moreover, SAI captures 60.2% of the performance gain delivered by the idealized Double SMEM design while reducing energy consumption to 87.7% of the baseline. These results highlight the effectiveness of SAI in enhancing thread-level parallelism and optimizing on-chip memory for AI workloads.

15 September 2025 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
YTYuhan Tang
Yuhan Tang
TLTiejun Li
Tiejun Li
SMSheng Ma
Sheng Ma
JZJianmin Zhang
Jianmin Zhang
HLHanqing Li
Hanqing Li
LWLizhou Wu
Lizhou Wu
The victim cache was originally designed as a small-capacity secondary cache to hold recently evicted lines from the L1 data cache in CPUs. However, this design is often suboptimal for graphics processing units (GPUs) due to the following two specific features of GPUs. First, a significant number of GPU applications have low hit rates in the L1 data cache, while the probability of lines evicted from the L1 data cache being subsequently reused is high. This means that the number of memory requests that hit in the victim cache can approach or even exceed the number of requests that hit in the L1 data cache. Second, GPUs use a unified architecture for the L1 data cache and shared memory, or the L1 cache and texture cache, to save hardware overhead. However, this hardware architecture significantly increases the L1 data cache access latency. We observe that some applications are susceptible to access latency, and increasing latency can severely degrade performance. To this end, we introduce HIVE+, an enhanced high-priority victim cache designed to accelerate GPU memory accesses. The key idea of HIVE+ is to exploit idle registers as the data array of the victim cache and place the tag array of the victim cache at a higher level in the memory hierarchy than the L1 data cache. Our experimental results show that HIVE+ achieves an average performance improvement of 47.5% and 35.0% compared to the baseline (BL) and Linebacker architectures, respectively.

16 September 2025 in Journal of Computational Electronics
Verified
Journal Article
Closed access
PDF file
SFSiqing Fu
Siqing Fu
LWLizhou Wu
Lizhou Wu
TLTiejun Li
Tiejun Li
CZChunyuan Zhang
Chunyuan Zhang
JZJianmin Zhang
Jianmin Zhang
SMSheng Ma
Sheng Ma

28 May 2021
Verified
Conference Paper
Closed access
SFSiqing Fu
Siqing Fu
TLTiejun Li
Tiejun Li
JZJianmin Zhang
Jianmin Zhang
Random simulation for particle transport theory is the main method for solving particle transport questions, which is widely used in medicine and computational physics. In this work, we present a multi-core reconfigurable architecture that aims to meet the performance per watt requirements of future Domain Specific Architectures (DSAs). The architecture proposed in this paper consists of heterogeneous lightweight cores, a reconfigurable cache structure, and High Bandwidth Memory. By targeting the different feature requirements of the Monte Carlo transport code at different stages, we design more necessary and efficient features for the lightweight calculating core, and continue to provide a trade-off of performance and energy consumption through reconfiguration. We designed and validated the accelerator architecture using gem5. Experiments show that compared with the traditional architecture composed of multiple out-of-order core, this architecture can obtain more than 3x in performance per watt. Some conclusions explored are not limited to the architecture proposed in this paper, but lay the foundation for further studies of large-scale transport accelerators.