Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chengtao An

dblp:343/6546 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2023
0000-0001-6456-2772ORCID · corroborated

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

Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021

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
2 papers
Electronic design automation · 64% Integrated circuit design · 21% High-performance computing · 16%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design
power grid analysis
1.322023
Unleashing the Power of Graph Spectral Sparsification for Power Grid Analysis via Incomplete Cholesky Factorization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023
FPDsim: A Structural Simulator For Power Grid Analysis Of Flat Panel Display · DAC 2023
Electronic design automation
circuit simulation
0.712023
FPDsim: A Structural Simulator For Power Grid Analysis Of Flat Panel Display · DAC 2023
Integrated circuit design › optoelectronic devices
flat panel display
0.712023
FPDsim: A Structural Simulator For Power Grid Analysis Of Flat Panel Display · DAC 2023
High-performance computing › numerical linear algebra
preconditioner
0.712023
Unleashing the Power of Graph Spectral Sparsification for Power Grid Analysis via Incomplete Cholesky Factorization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023
Electronic design automation › circuit simulation
spectral graph sparsification
0.712023
Unleashing the Power of Graph Spectral Sparsification for Power Grid Analysis via Incomplete Cholesky Factorization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023
Integrated circuit design
power delivery network
0.212023
FPDsim: A Structural Simulator For Power Grid Analysis Of Flat Panel Display · DAC 2023

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

structural solver · 0.7stamping scheme · 0.7preconditioned conjugate gradient · 0.7incomplete cholesky factorization · 0.7
YearPublicationVenuePosition
2023 FPDsim: A Structural Simulator For Power Grid Analysis Of Flat Panel Display
abstract
As the resolution continues to increase, the scale of the power grid of the flat panel display (FPD) becomes huge. This imposes a severe computational challenge for analysis and storage. In this paper, based on the highly periodic FPD structure, we present an efficient simulator which contains a novel stamping scheme and a fast structural solver. Experiments on real industrial cases show that compared to the conventional stamping scheme, our proposed stamping scheme achieves up to 118× speedup in 74× less memory; compared to the state-of-art direct solver, Cholmod, our proposed structural solver achieves up to 17× speedup in 5× less memory.
Chengtao An, Chunqiao Li, Xiangqi Li, Yangfeng Su, Fan Yang 0001, Xuan Zeng 0001
DAC1
2023 Unleashing the Power of Graph Spectral Sparsification for Power Grid Analysis via Incomplete Cholesky Factorization
abstract
Graph spectral sparsification-based preconditioning technique has shown promising results for power grid analysis. However, the conventional methods converge slowly for high-accuracy requirement. In this work, we propose an efficient approach to address this issue. Instead of using the Cholesky factorization, we employ the incomplete Cholesky factorization to factorize the spectral sparsifier. We also propose a concept of graph spectral pattern, which can further reduce the preconditioned conjugate gradient (PCG) iterations using less number of nonzeros. Experiments show that under 10−6 relative tolerance, our proposed preconditioning technique achieves$1.17\times $speedup compared to AMGPCG in average; compared to the conventional spectral sparsification-based preconditioning techniques, our proposed approach achieves up to$8.53\times $speedup of the factorization,$8.74\times $speedup of the PCG iteration, and$5.6\times $speedup of the total time. Moreover, the speedup of the total time continues to enlarge for higher-accuracy requirement, e.g., 10−12. Finally, but not least, our method is compatible with existing graph spectral sparsification algorithms for power grid analysis.
Chunqiao Li, Chengtao An, Zhengqi Gao, Fan Yang 0001, Yangfeng Su, Xuan Zeng 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
2023 ESPSim: An Efficient Scalable Power Grid Simulator Based on Parallel Algebraic Multigrid
abstract
Fast verification for the extremely large-scale power grid is demanding as CMOS technology advances consistently. In this work, we propose ESPSim, an efficient scalable power grid simulator based on a parallel smoothed aggregation-based algebraic multigrid technique. ESPSim has the ability to do fast DC and transient analysis through MPI and adaptive timestep control mechanism. Thanks to the smoother applied on the prolongation operator, ESPSim copes well with the convergence rate on extremely large-scale power grid transient analysis. Extensive experiments are conducted with a variety of serial/parallel solvers. The runtime of ESPSim is linear with case size. With 16 processors, 1,000 timesteps transient analysis of 63.4M nodes can be completed in 22.1 min. Over 22× speedup compared to the well-known direct solver Cholmod is observed.
Chunqiao Li, Chengtao An, Fan Yang 0001, Xuan Zeng 0001
ACM Trans. Design Autom. Electr. Syst.2