Zizheng Guo

Zizheng Guo

Auto-generated profile, based on publicly available information

Zizheng Guo

Peking University

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
30 January 2023 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
PLPeiyu Liao
Peiyu Liao
DGDawei Guo
Dawei Guo
ZGZizheng Guo
Zizheng Guo
SLSiting Liu
Siting Liu
YLYibo Lin
Yibo Lin
BYBei Yu
Bei Yu
Optimizing timing is critical to the design closure of integrated circuits (IC). However, most existing algorithms for circuit placement focus on the optimization of wirelength instead of timing metrics. This paper presents a timing-driven placement framework. It consists of a global placement stage based on net weighting with momentum, and a detailed placement stage based on Lagrangian multipliers. By improving the preconditioners and timing engines to facilitate net weighting and discrete local search, we have achieved superior timing improvement on benchmarks from ICCAD 2015 contest, including worst negative slack (WNS) and total negative slack (TNS).

14 June 2023 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
ZGZizheng Guo
Zizheng Guo
THTsung-Wei Huang
Tsung-Wei Huang
YLYibo Lin
Yibo Lin
Static timing analysis (STA) is an essential yet time-consuming task during the circuit design flow to ensure the correctness and performance of the design. Thanks to the advancement of general-purpose computing on graphics processing units (GPUs), new possibilities and challenges have arisen for boosting the performance of STA. In this work, we present an efficient and holistic GPU-accelerated STA engine. We accelerate major STA tasks, including levelization, delay computation, graph propagation, and multicorner analysis, by developing high-performance GPU kernels and data structures. By dividing the STA workloads into CPU–GPU concurrent tasks with managed dependencies, our acceleration framework supports versatile incremental updates. Furthermore, we have extended our approach to multicorner analysis by exploring a large amount of corner-level data parallelism using GPU computing. Our implementation based on the open-source STA engine OpenTimer has achieved up to $4.07\times $ speed-up on single corner analysis, and up to $25.67\times $ speed-up on multicorner analysis on TAU 2015 contest designs and a 14-nm technology.

9 May 2023 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
GGGuannan Guo
Guannan Guo
THTsung-Wei Huang
Tsung-Wei Huang
YLYibo Lin
Yibo Lin
ZGZizheng Guo
Zizheng Guo
SYSushma Yellapragada
Sushma Yellapragada
MWMartin D. F. Wong
Martin D. F. Wong
As a key routine in Static Timing Analysis (STA), Path-based Analysis (PBA) plays a very important role in refining the critical path report by reducing excessive slack pessimism. PBA is also well known for its long execution time, which makes it a hot topic for parallel computing in the STA community. However, nearly all of the parallel PBA algorithms are restricted to CPU architectures, which greatly limits their scalability. To achieve a new performance milestone on PBA, we must leverage the high throughput computing in the graphics processing unit (GPU). Therefore, in this work, we propose a new GPU-accelerated PBA framework which contains compact data structures and highly efficient kernels. By integrating with GPU-accelerated preprocessing steps, our framework can also effectively handle extensive critical path constraints. Besides, we highlight many optimization techniques that can overcome the execution bottleneck and further boost the performance. In experiments, we demonstrate 543× speed-up compared to the state-of-the-art PBA algorithm on the design with 1.6 million gates, which outperforms 25–45× over the state-of-the-art parallel PBA algorithm on 40 CPU cores. A fully optimized framework can achieve 3–5× speed-up on top of that.

23 June 2024
Verified
Conference Paper
Open access
YDYufan Du
Yufan Du
ZGZizheng Guo
Zizheng Guo
XJXun Jiang
Xun Jiang
ZCZhuomin Chai
Zhuomin Chai
YZYuxiang Zhao
Yuxiang Zhao
RHRu Huang
Ru Huang
Accurate and efficient power analysis at early VLSI design stages is critical for effective power optimization. It is a promising yet challenging task to model the circuit power at early design stages, especially during placement with the clock tree and final signal routing unavailable. Additionally, optimization-induced circuit transformations like circuit restructuring and gate sizing can invalidate fine-grained power supervision. Addressing these difficulties, we introduce the first circuit-transformation-aware power prediction model at placement stage with robust generalization capabilities. Our technology includes a dedicated clock tree model and an innovative train-and-calibrate scheme that effectively integrates topological and layout features. Compared to the cutting-edge commercial IC engine Innovus, we have significantly reduced the cross-stage power analysis error between placement and detailed routing.

17 January 2022
Verified
Conference Paper
Closed access
KZKexing Zhou
Kexing Zhou
ZGZizheng Guo
Zizheng Guo
THTsung-Wei Huang
Tsung-Wei Huang
YLYibo Lin
Yibo Lin
Path searching is a central step in static timing analysis (STA). State-of-the-art algorithms need to generate path deviations for hundreds of thousands of paths, which becomes the runtime bottleneck of STA. Accelerating path searching is a challenging task due to the complex and iterative path generating process. In this work, we propose a novel path searching algorithm that has asymptotically lower runtime complexity than the state-of-the-art. We precompute the path deviations using mergeable heap and apply a group of deviations to a path in near-constant time. We prove our algorithm has a runtime complexity of $O(n\log n+k\log k)$ which is asymptotically smaller than the state-of-the-art $O(nk)$ . Experimental results show that our algorithm is up to $60\times$ faster compared to OpenTimer and $1.8\times$ compared to the leading path search algorithm based on suffix forest.

27 October 2024
Verified
Conference Paper
Open access
YDYufan Du
Yufan Du
ZGZizheng Guo
Zizheng Guo
YLYibo Lin
Yibo Lin
RWRunsheng Wang
Runsheng Wang
RHRu Huang
Ru Huang