Zhengyong Zhu

dblp:52/3113 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2007
0000-0002-3348-4553ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Electronic design automation · 82% High-performance computing · 16% Integrated circuit design · 2%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
circuit simulation
0.122007
Two-Stage Newton-Raphson Method for Transistor-Level Simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2007
Power network analysis using an adaptive algebraic multigrid approach · DAC 2003
Electronic design automation › circuit simulation › analog circuit simulation
SPICE simulation
0.112007
Two-Stage Newton-Raphson Method for Transistor-Level Simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2007
Electronic design automation › circuit simulation › device and circuit simulation
transistor-level simulation
0.112007
Two-Stage Newton-Raphson Method for Transistor-Level Simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2007
High-performance computing › iterative methods
algebraic multigrid
0.012003
An algebraic multigrid solver for analytical placement with layout based clustering · DAC 2003
Electronic design automation › physical design › placement
analytical placement
0.012003
An algebraic multigrid solver for analytical placement with layout based clustering · DAC 2003
High-performance computing › numerical linear algebra
linear solver
0.012003
An algebraic multigrid solver for analytical placement with layout based clustering · DAC 2003
Electronic design automation
physical design
0.012003
An algebraic multigrid solver for analytical placement with layout based clustering · DAC 2003
Electronic design automation › physical design
placement
0.012003
An algebraic multigrid solver for analytical placement with layout based clustering · DAC 2003
Electronic design automation › physical design
power grid analysis
0.012003
Power network analysis using an adaptive algebraic multigrid approach · DAC 2003
Integrated circuit design
VLSI design
0.012003
An algebraic multigrid solver for analytical placement with layout based clustering · DAC 2003

Methods — techniques the papers use, named apart from their topics

algebraic multigrid · 0.1newton-raphson method · 0.1multigrid · 0.1multilevel method · 0.0layout-based clustering · 0.0error smoothing · 0.0adaptive coarsening · 0.0
YearPublicationVenuePosition
2007 Two-Stage Newton-Raphson Method for Transistor-Level Simulation
abstract
In this paper, we introduce an efficient transistorlevel simulation tool with SPICE-accuracy for deepsubmicrometer very large-scale integration circuits with strong-coupling effects. The new approach uses multigrid for huge networks of power/ground, clock, and interconnect with strong coupling. Mutual inductance can be incorporated without error-prone matrix sparsification approximations or expensive matrix inversion. Transistor devices are integrated using a novel two-stage Newton–Raphson method to dynamically model the linear network and nonlinear devices boundary. Orders-ofmagnitude speedup over Berkeley SPICE3 is observed for sets of real deep-submicrometer design circuits.
Zhengyong Zhu, He Peng, Chung-Kuan Cheng, Khosro Rouz, Manjit Borah, Ernest S. Kuh
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2006 An unconditional stable general operator splitting method for transistor level transient analysis
abstract
In this paper, we introduce a general operator splitting method for transient simulation of VLSI circuits. The proposed approach generates special partitions of the circuits and alternates the explicit and implicit integrations between the partitions. We prove that the method is unconditionally stable independent of the step size. The splitting scheme greatly reduces the nonzero fill-ins generated in direct methods like LU decomposition. Orders of magnitude speedup over Berkeley SPICE3 is observed for sets of circuits.
Zhengyong Zhu, Rui Shi 0003, Chung-Kuan Cheng, Ernest S. Kuh
ASP-DAC1
2005 Efficient transient simulation for transistor-level analysis
abstract
In this paper, we introduce an efficient transistor level simulation tool with SPICE-accuracy for deep-submicron(DSM) VLSI circuits with strong coupling effects. The new approach uses multigrid for large networks of power/ground, clock and signal interconnect. Transistor devices are integrated using a novel two-stage Newton-Raphson method to dynamically model the linear network and nonlinear devices interface. Orders of magnitude speedup over Berkeley SPICE3 is observed for sets of DSM design circuits.
Zhengyong Zhu, Khosro Rouz, Manjit Borah, Chung-Kuan Cheng, Ernest S. Kuh
ASP-DAC1
2003 An algebraic multigrid solver for analytical placement with layout based clustering
abstract
An efficient matrix solver is critical to the analytical placement. As the size of the matrix becomes huge, the multilevel methods turn out to be more efficient and more scalable. Algebraic Multigrid (AMG) is a multilevel technique to speedup the iterative matrix solver [10]. We apply the algebraic multigrid method to solve the linear equations that arise from the analytical placement. A layout based clustering scheme is put forward to generate coarsening levels for the multigrid method. The experimental results show that the algebraic multigrid solver is promising for analytical placement.
Hongyu Chen 0001, Chung-Kuan Cheng, Nan-Chi Chou, Andrew B. Kahng, John F. MacDonald, Peter Suaris, Bo Yao 0004, Zhengyong Zhu
DAC8
2003 Power network analysis using an adaptive algebraic multigrid approach
abstract
In this paper, we introduce an efficient analysis method for the power network of general topology. The new approach is based on algebraic multigrid (AMG) method that can avoid the slow convergence of basic iterative methods. An innovative adaptive coarsening and error-smoothing scheme is employed to further speed up the performance, taking advantage of the spatial variation of power supply noise. Experimental results show that our method is more than 100 times faster than SPICE3.
Zhengyong Zhu, Bo Yao 0004, Chung-Kuan Cheng
DAC1