Xin Gao
Xin Gao has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Jiawei Nian
North China Electric Power University
4 shared publications - Mengfei Yang
China Academy of Space Technology
4 shared publications - Fang Fang
North China Electric Power University
1 shared publication Hongjin Liu
Beijing SunWise Space Technology Ltd., Beijing, PR China
1 shared publication- Hongjin Liu
Beijing SunWise Space Technology Ltd., Beijing 100190, China
1 shared publication - Hongjin Liu
Beijing SunWise Space Technology Ltd., Beijing 100190, China
1 shared publication
Latest Publications
- Open Access
- 7 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
RPFF-PA : Reliable and Parallel Fault-tolerant Framework for Path Latency Reduction Deployed in Register Arrays
Soft errors can lead to electronic device failures caused by radiation events. Therefore, fault-tolerant designs are essential for safeguarding critical memory components and processors. The N-modular redundancy (NMR) scheme presents a practical means of implementing register protection. However, the NMR fault-tolerant scheme is serially configured on the critical path, increasing path latency of approximately 12.4 \(\% \) -35.5 \(\% \) . In this paper, we propose a parallel fault-tolerant framework for register arrays(RPFF-PA), which realizes the parallelized execution of hardern processes and read/write operations. By executing the decoding process in parallel with the decision circuit, the latency cost caused by fault-tolerant components is significantly reduced. The results demonstrate that the strategy reduces path latency by 5.2 \(\% \) -20.3 \(\% \) compared to the original NMR approach. Furthermore, the framework includes a real-time error correction module capable of effectively addressing the error accumulation issue, thereby enhancing the reliability of the fault-tolerant system.- 7 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
Open AccessRPFF-PA : Reliable and Parallel Fault-tolerant Framework for Path Latency Reduction Deployed in Register Arrays
Soft errors can lead to electronic device failures caused by radiation events. Therefore, fault-tolerant designs are essential for safeguarding critical memory components and processors. The N-modular redundancy (NMR) scheme presents a practical means of implementing register protection. However, the NMR fault-tolerant scheme is serially configured on the critical path, increasing path latency of approximately 12.4 \(\% \) -35.5 \(\% \) . In this paper, we propose a parallel fault-tolerant framework for register arrays(RPFF-PA), which realizes the parallelized execution of hardern processes and read/write operations. By executing the decoding process in parallel with the decision circuit, the latency cost caused by fault-tolerant components is significantly reduced. The results demonstrate that the strategy reduces path latency by 5.2 \(\% \) -20.3 \(\% \) compared to the original NMR approach. Furthermore, the framework includes a real-time error correction module capable of effectively addressing the error accumulation issue, thereby enhancing the reliability of the fault-tolerant system. - Open Access
- 1 April 2024
- Published by MDPI AG in Electronics
- Vol. 13 (7) , 1320
Two-Dimensional Protection Code for Virtual Page Information in Translation Lookaside Buffers
Severe conditions such as high-energy particle strikes may induce soft errors in on-chip memory, like cache and translation lookaside buffers (TLBs). As the key component of virtual-to-physical address translation, TLB directly affects processor performance. To protect the virtual page information stored in TLB, several studies have introduced error detection or correction codes. However, most schemes proposed for data TLB cannot support the detection of multi-bit upsets, which is reported as a serious issue in modern fault-tolerant processors due to the downscaling of CMOS process technology. In this paper, we propose a new two-dimensional protection technique, called the matrix protection tag (MaP-Tag), to provide stronger error detection and correction capability to TLB virtual page information. Our proposal reorganizes virtual page information into a matrix and employs adjacent check bits and interleaved check bits for error detection. The two-dimensional design offers one-bit error detection, burst multi-bit error detection, and even multi-bit error correction in some cases. The simulation results show that our proposal can detect almost all error patterns when injected with up to eight bit-flips. Furthermore, the technique provides a better error correction rate than conventional single error correction (SEC) codes. The reliability calculation shows that our proposal is powerful in both error detection and correction with affordable storage overhead.
- 1 April 2024
- Published by MDPI AG in Electronics
- Vol. 13 (7) , 1320
Open AccessTwo-Dimensional Protection Code for Virtual Page Information in Translation Lookaside Buffers
Severe conditions such as high-energy particle strikes may induce soft errors in on-chip memory, like cache and translation lookaside buffers (TLBs). As the key component of virtual-to-physical address translation, TLB directly affects processor performance. To protect the virtual page information stored in TLB, several studies have introduced error detection or correction codes. However, most schemes proposed for data TLB cannot support the detection of multi-bit upsets, which is reported as a serious issue in modern fault-tolerant processors due to the downscaling of CMOS process technology. In this paper, we propose a new two-dimensional protection technique, called the matrix protection tag (MaP-Tag), to provide stronger error detection and correction capability to TLB virtual page information. Our proposal reorganizes virtual page information into a matrix and employs adjacent check bits and interleaved check bits for error detection. The two-dimensional design offers one-bit error detection, burst multi-bit error detection, and even multi-bit error correction in some cases. The simulation results show that our proposal can detect almost all error patterns when injected with up to eight bit-flips. Furthermore, the technique provides a better error correction rate than conventional single error correction (SEC) codes. The reliability calculation shows that our proposal is powerful in both error detection and correction with affordable storage overhead.
- Open Access
- 23 March 2024
- Published by MDPI AG in Electronics
- Vol. 13 (7) , 1185
Enhancing Power Efficiency in Branch Target Buffer Design with a Two-Level Prediction Mechanism
Modern processors often face challenges when handling instructions that overwhelm the branch target buffer (BTB), leading to front-end bottlenecks. As the BTB’s capacity increases, its prediction module can become slower and power-hungry. In this paper, we introduce a straightforward yet highly effective two-level prediction mechanism to mitigate the escalating power consumption in the BTB structure, achieved by reducing the number of accesses. Our approach incorporates two main elements: M-BTB and V-BTB. M-BTB encompasses the first-level prediction mechanism and a fully associative BTB, while V-BTB houses the second-level prediction mechanism and a set-associative BTB. To implement our prediction mechanism, we optimize the traditional two-level BTB structure. The first level employs the skew mechanism, and the second level dissects the tag bits to create the Partial tag. These two levels of prediction mechanism correspond to the bank/way prediction for the two-level BTB structure. Our experimental results show that the first-stage prediction mechanism reduces M-BTB accesses by 75%, while the second-stage prediction mechanism ensures that over 98% of addresses require just zero or one way of the V-BTB to achieve a hit result. Our proposed approach achieves a remarkable 86–97% reduction in power consumption, with a minimal impact on performance and an increase in overall area efficiency.
- 23 March 2024
- Published by MDPI AG in Electronics
- Vol. 13 (7) , 1185
Open AccessEnhancing Power Efficiency in Branch Target Buffer Design with a Two-Level Prediction Mechanism
Modern processors often face challenges when handling instructions that overwhelm the branch target buffer (BTB), leading to front-end bottlenecks. As the BTB’s capacity increases, its prediction module can become slower and power-hungry. In this paper, we introduce a straightforward yet highly effective two-level prediction mechanism to mitigate the escalating power consumption in the BTB structure, achieved by reducing the number of accesses. Our approach incorporates two main elements: M-BTB and V-BTB. M-BTB encompasses the first-level prediction mechanism and a fully associative BTB, while V-BTB houses the second-level prediction mechanism and a set-associative BTB. To implement our prediction mechanism, we optimize the traditional two-level BTB structure. The first level employs the skew mechanism, and the second level dissects the tag bits to create the Partial tag. These two levels of prediction mechanism correspond to the bank/way prediction for the two-level BTB structure. Our experimental results show that the first-stage prediction mechanism reduces M-BTB accesses by 75%, while the second-stage prediction mechanism ensures that over 98% of addresses require just zero or one way of the V-BTB to achieve a hit result. Our proposed approach achieves a remarkable 86–97% reduction in power consumption, with a minimal impact on performance and an increase in overall area efficiency.
- 28 January 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 155, 39-52
ReBEC: A replacement-based energy-efficient fault-tolerance design for associative caches
- 28 January 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 155, 39-52
ReBEC: A replacement-based energy-efficient fault-tolerance design for associative caches