Qiwang Chen

Qiwang Chen

Auto-generated profile, based on publicly available information

Qiwang Chen

Xidian University, Xi'an, Shaaxi, China

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

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

Representative Publications

View All Publications
26 July 2026
Verified
Conference Paper
Open access
SBShunyang Bi
Shunyang Bi
QCQiwang Chen
Qiwang Chen
JTJing Tang
Jing Tang
ZTZhengguang Tang
Zhengguang Tang
HWHaonan Wu
Haonan Wu
CLCong Li
Cong Li
The efficiency of processor-based emulation (PBE) heavily depends on the computations of scheduling. In the scheduling process, the challenge in accurate modeling time step stems from the complex instruction execution process, which is influenced by both the inter-processor communication latency, the execution sequence of the allocated nodes, and scheduling constraints. Therefore, existing works struggle with the inability to optimize the time step directly. In this paper, inspired by the key insight of the inherent connection between the time step and the topological order balancing of the netlist graph, we propose the topological order balancing-driven scheduling algorithm. Our approach introduces the mobility-prioritized node selection and efficient forward and backward propagation. Besides, a theorem is presented to reduce the time complexity of gain calculation to O (1). Experiments demonstrate significant improvements over the SOTA scheduling algorithm, achieving 72% better TOB metric, 22.5% reduction in time steps, and 55% faster runtime on public and open-source chip benchmarks, thus proving TOB as a critical metric for the scheduling process and enhancing the efficiency and performance of PBE emulation.