Dong Liu

Dong Liu

Auto-generated profile, based on publicly available information

Dong Liu

School of Software, Dalian University of Technology

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
28 August 2024 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
XZXu Zhao
Xu Zhao
HJHe Jiang
He Jiang
SGShikai Guo
Shikai Guo
DLDong Liu
Dong Liu
HLHui Liu
Hui Liu
XLXiaochen Li
Xiaochen Li
Printed circuit board (PCB) design software is an important category of electronic design automation (EDA) tool which aims to simplify PCB design through graphical interaction. As a type of software, PCB design software is also susceptible to software bugs. Bugs in PCB design software may cause huge losses since they could directly affect the correctness of the final PCBs, which are often used in safety-critical fields. Unfortunately, the lack of understanding of bugs in PCB design software impedes the effective handling of these bugs. To this end, we present the first empirical study to analyze the characteristics of PCB design software bugs. Specifically, we collect 349 bugs from two popular open-source PCB design software projects (i.e., KiCAD and LibrePCB) and investigate the root causes, symptoms, relationships between root causes and symptoms, bug-prone components, and bug fix characteristics. Based on the analysis, we get 13 findings. For example, the majority of bugs are caused by implementation logic errors, resulting from lacking/misunderstanding domain knowledge, such as electrical engineering principles, component placement and arrangement, hierarchical layout techniques, and signal transmission considerations. From these findings, we draw the guidelines for PCB design software development and future research in bug detection, localization, and repair.


6 August 2025 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
HJHe Jiang
He Jiang
LFLiuwei Fu
Liuwei Fu
DLDong Liu
Dong Liu
ZRZhilei Ren
Zhilei Ren
YCYuting Chen
Yuting Chen
LQLei Qiao
Lei Qiao
In modern microarchitectures, machine-learning-based prefetchers use past memory requests to learn access patterns and predict memory addresses, thereby prefetching data into the cache to mitigate the processor-memory speed gap. However, they face two key challenges in capturing irregular access patterns generated by complex data structures and algorithms. One is data dispersion: the disorderliness of memory addresses makes it difficult for prefetchers to extract meaningful data features. The other is temporal and spatial complexity: existing prefetchers fail to effectively learn temporal and spatial characteristics, and thus are unable to explore more complex access patterns. To resolve these challenges, we propose TRACED, a novel temporal graph neural network-based prefetcher aimed at learning access patterns of memory addresses. TRACED consists of two key components: a dynamic clustering component and a temporal graph neural network component. In the dynamic clustering component, we introduce a similarity function to quantify the similarity of memory addresses. Based on the quantified similarity, we dynamically group unordered memory addresses into different clusters. This ensures that the memory addresses in each cluster are ordered and change smoothly, thus resolving the first challenge. The temporal graph neural network component constructs a spatiotemporal graph to represent relationships among memory addresses. This helps capture temporal and spatial characteristics both across and within clusters, thus resolving the second challenge. This paper demonstrates the effectiveness of the proposed prefetcher through experiments. Specifically, in terms of accuracy, TRACED outperforms BO, SPP, DOMINO, Delta-LSTM, and VOYAGER by 2.29%-40.83% on average. Furthermore, TRACED attains remarkable coverage of 55.67% and IPC of 43.75%, outperforming all competing approaches in both metrics.