Huijing Yang

Dr. Huijing Yang


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
27 February 2024 in The Journal of Supercomputing
Verified
Journal Article
Open access
PDF file
HYHuijing Yang
Huijing Yang
Juan FangJuan Fang
Juan Fang
XSXing Su
Xing Su
Zhi CaiZhi Cai
Zhi Cai
YWYuening Wang
Yuening Wang
Modern processors employ data prefetchers to alleviate the impact of long memory access latency. However, current prefetchers are designed for specific memory access patterns, which perform poorly on mixed applications with multiple memory access patterns. To address these issues, RL-CoPref, a reinforcement learning (RL)-based coordinated prefetching controller for multiple prefetchers, is proposed in this paper. RL-CoPref takes diverse program context information as the input, learns to maximize cumulative rewards, and evaluates prefetch quality based on prefetch hits/misses and memory bandwidth utilization. It can dynamically adjust the prefetch activation and prefetch degree, enabling multiple prefetchers to complement each other on mixed applications. Our extensive evaluation, utilizing the ChampSim simulator, demonstrates that RL-CoPref can effectively adapt to various workloads and system configurations, optimizing prefetch control. On average, RL-CoPref achieves 76.15% prefetch coverage, having 35.50% IPC improvement, outperforming state-of-the-art individual prefetchers by 5.91–16.54% and outperforming SBP, a state-of-the-art (non-RL) prefetch controller, by 4.64%.

30 March 2023 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
HYHuijing Yang
Huijing Yang
Juan FangJuan Fang
Juan Fang
MCMin Cai
Min Cai
Zhi CaiZhi Cai
Zhi Cai

18 November 2022 in Micromachines
Verified
Journal Article
Open access
PDF file
Juan FangJuan Fang
Juan Fang
HKHan Kong
Han Kong
HYHuijing Yang
Huijing Yang
YXYixiang Xu
Yixiang Xu
MCMin Cai
Min Cai
In an asymmetric multi-core architecture, multiple heterogeneous cores share the last-level cache (LLC). Due to the different memory access requirements among heterogeneous cores, the LLC competition is more intense. In the current work, we propose a heterogeneity-aware replacement policy for the partitioned cache (HAPC), which reduces the mutual interference between cores through cache partitioning, and tracks the shared reuse state of each cache block within the partition at runtime to guide the replacement policy to keep cache blocks shared by multiple cores in multithreaded programs. In the process of updating the reuse state, considering the difference of memory accesses to LLC by heterogeneous cores, the cache replacement policy tends to keep cache blocks required by big cores, to better improve the LLC access efficiency of big cores. Compared with LRU and the SRCP, which are the state-of-the-art cache replacement algorithms, the performance of big cores can be significantly improved by HAPC when running multithreaded programs, while the impact on little cores is almost negligible, thus improving the overall performance of the system.

17 October 2021 in Micromachines
Verified
Journal Article
Open access
PDF file
Juan FangJuan Fang
Juan Fang
ZWZelin Wei
Zelin Wei
HYHuijing Yang
Huijing Yang
GPGPUs has gradually become a mainstream acceleration component in high-performance computing. The long latency of memory operations is the bottleneck of GPU performance. In the GPU, multiple threads are divided into one warp for scheduling and execution. The L1 data caches have little capacity, while multiple warps share one small cache. That makes the cache suffer a large amount of cache contention and pipeline stall. We propose Locality-Based Cache Management (LCM), combined with the Locality-Based Warp Scheduling (LWS), to reduce cache contention and improve GPU performance. Each load instruction can be divided into three types according to locality: only used once as streaming data locality, accessed multiple times in the same warp as intra-warp locality, and accessed in different warps as inter-warp data locality. According to the locality of the load instruction, LWS applies cache bypass to the streaming locality request to improve the cache utilization rate, extend inter-warp memory request coalescing to make full use of the inter-warp locality, and combine with the LWS to alleviate cache contention. LCM and LWS can effectively improve cache performance, thereby improving overall GPU performance. Through experimental evaluation, our LCM and LWS can obtain an average performance improvement of 26% over baseline GPU.

28 July 2023 in Frontiers of Information Technology & Electronic Engineering
Verified
Journal Article
Closed access
PDF file
Juan FangJuan Fang
Juan Fang
SLSheng Lin
Sheng Lin
HYHuijing Yang
Huijing Yang
YXYixiang Xu
Yixiang Xu
XSXing Su
Xing Su
When multiple central processing unit (CPU) cores and integrated graphics processing units (GPUs) share off-chip main memory, CPU and GPU applications comp

10 March 2023 in The Journal of Supercomputing
Verified
Journal Article
Open access
PDF file
Juan FangJuan Fang
Juan Fang
LZLi’aNg Zhao
Li’aNg Zhao
MCMin Cai
Min Cai
HYHuijing Yang
Huijing Yang
Normally, threads in a warp do not severely interfere with each other. However, the scheduler must wait until all the threads within complete before scheduling the next warp, resulting in memory divergence. The crux of the problem is scheduling the warp in a more reasonable order. Therefore, we propose a new warp scheduling strategy called WSMP, which is based on multi-level feedback queue (MFQ) and perceptron-based prefetch filtering (PPF). All the warps are sorted beforehand according to the latency tolerance of the warps and pushed into a certain queue in MFQ. We also remold PPF to enhance the modified underlying prefetcher. We are able to strike a balance between cache hit rate and prefetch coverage then. We verify its feasibility using GPGPU-Sim, along with exclusive GPGPU workload. The results show that compared to the baseline, WSMP improves IPC by 26.45% and reduces L2 cache miss rate by 9.54% on average.