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

Jihai Meng

dblp:389/6988 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
0009-0001-5408-2772ORCID · reported

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

Systems, architecture and hardware · 1 · 1 first-author · 1 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
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › placement
congestion-aware placement
0.812024
Late Breaking Results: Coulomb Force-Based Routability-Driven Placement Considering Global and Local Congestion · DAC 2024
Electronic design automation
physical design
0.812024
Late Breaking Results: Coulomb Force-Based Routability-Driven Placement Considering Global and Local Congestion · DAC 2024
Electronic design automation › physical design
placement
0.812024
Late Breaking Results: Coulomb Force-Based Routability-Driven Placement Considering Global and Local Congestion · DAC 2024
Electronic design automation › physical design › placement
routability-driven placement
0.812024
Late Breaking Results: Coulomb Force-Based Routability-Driven Placement Considering Global and Local Congestion · DAC 2024

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

coulomb force-based placement · 0.8cell padding · 0.8
YearPublicationVenuePosition
2024 Late Breaking Results: Coulomb Force-Based Routability-Driven Placement Considering Global and Local Congestion
abstract
Placement is a critical stage for VLSI routability optimization. A placement engine without considering the layout congestion might lead to poor solutions with routing failures. This paper introduces a Coulomb force-based global placement framework that addresses global and local routing congestions. We first present a routing path-based cell padding strategy for local congestion mitigation. Then, we construct a routability-aware placement model that utilizes virtual Coulomb forces to eliminate crucial global congestion. Compared with a leading academic placer, RePlAce, and the advanced commercial tool, Innovus, the experimental results on industrial benchmark suites show that our proposed algorithm achieves the best routability within the shortest runtime.
Jihai Meng, Shaohong Weng, Zhijie Cai, Yilu Chen, Zhifeng Lin, Jianli Chen
DAC1