Demo Data from EDBT 2026 / reviewers in the wild / expert
Chen Li 0004
dblp:l/ChenLi4
· DBLP profile ↗
6ranked-venue papers
3as first author
0since 2021 · last 2007
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 6 · 3 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
2 papers |
Electronic design automation · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation
physical design |
0.1 | 2 | 2007 | Routability-Driven Placement and White Space Allocation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2007 Mixed block placement via fractional cut recursive bisection · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005 |
Electronic design automation › physical design
placement |
0.1 | 2 | 2007 | Routability-Driven Placement and White Space Allocation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2007 Mixed block placement via fractional cut recursive bisection · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005 |
Electronic design automation › physical design › placement
routability-driven placement |
0.1 | 1 | 2007 | Routability-Driven Placement and White Space Allocation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2007 |
Electronic design automation › physical design › floorplanning
white space allocation |
0.1 | 1 | 2007 | Routability-Driven Placement and White Space Allocation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2007 |
Methods — techniques the papers use, named apart from their topics
multilevel global placement · 0.1congestion-driven placement · 0.1fractional cut recursive bisection · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Routability-Driven Placement and White Space AllocationabstractWe present a two-stage congestion-driven placement flow. First, during each refinement stage of our multilevel global placement framework, we replace cells based on the wirelength weighted by congestion level to reduce the routing demands of congested regions. Second, after the global placement stage, we allocate appropriate amounts of white space into different regions of the chip according to a congestion map by shifting cut lines in a top-down fashion and apply a detailed placer to legalize the placement and further reduce the half-perimeter wirelength while preserving the distribution of white space. Experimental results show that our placement flow can achieve the best routability with the shortest routed wirelength among publicly available placement tools on IBM v2 benchmarks. Our placer obtains 100% successful routings on 16 IBM v2 benchmarks with shorter routed wirelengths by 3.1% to 24.5% compared to other placement tools. Moreover, our white space allocation approach can significantly improve the routability of placements generated by other placement tools. Chen Li 0004, Min Xie 0004, Cheng-Kok Koh, Jason Cong, Patrick H. Madden |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 1 |
| 2006 | Postlayout optimization for synthesis of Domino circuitsabstractLogic duplication, a commonly used synthesis technique to remove trapped inverters in reconvergent paths of Domino circuits, incurs high area and power penalties. In this article, we propose a synthesis scheme to reduce the duplication cost by allowing inverters in Domino logic under certain timing constraints for both simple and complex gates. Moreover, we can include the logic duplication minimization during technology mapping for synthesis of Domino circuits with complex gates. In order to guarantee the robustness of such Domino circuits, we perform the logic optimization as a postlayout step. Experimental results show significant reduction in duplication cost, which translates into significant improvements in area and power. As a byproduct, the timing performance is also improved owing to smaller layout area and/or logic depth. Aiqun Cao, Ruibing Lu, Chen Li 0004, Cheng-Kok Koh |
ACM Trans. Design Autom. Electr. Syst. | 3 |
| 2005 | Floorplan management: incremental placement for gate sizing and buffer insertionabstractIncremental physical design is an important methodology towards achieving design closure for high-performance large-scale circuits. Placement tools must accommodate incremental changes to the layout and netlist due to physical synthesis techniques without perturbing the original metrics. We present an incremental placement approach using floorplan sizing to manage the resources and demands of the whole chip region in order to accommodate the changes due to gate sizing and buffer insertion. The experimental results show that this approach can accommodate a wide range of incremental changes without a loss in wirelength and routability. Most important, it also maintains the stability of a placement such that the convergence of physical synthesis iterations can be greatly enhanced. Chen Li 0004, Cheng-Kok Koh, Patrick H. Madden |
ASP-DAC | 1 |
| 2005 | Mixed block placement via fractional cut recursive bisectionabstractRecursive bisection is a popular approach for large scale circuit placement problems, combining a high degree of scalability with good results. In this paper, we present a bisection-based approach for both standard cell and mixed block placement; in contrast to prior work, our horizontal cut lines are not restricted to row boundaries. This technique, which we refer to as a fractional cut, simplifies mixed block placement and also avoids a narrow region problem encountered in standard cell placement. Our implementation of these techniques in the placement tool Feng Shui 2.6 retains the speed and simplicity for which bisection is known, while making it competitive with leading methods on standard cell designs. On mixed block placement problems, we obtain substantial improvements over recently published work. Half perimeter wire lengths are reduced by 29% on average, compared to a flow based on Capo and Parquet; compared to mPG-ms, wire lengths are reduced by 26% on average. Ameya R. Agnihotri, Satoshi Ono, Chen Li 0004, Mehmet Can Yildiz, Ateen Khatkhate, Cheng-Kok Koh, Patrick H. Madden |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 3 |
| 2004 | Routability-driven placement and white space allocationabstractWe present a congestion-driven placement flow. First, we consider in the global placement stage the routing demand to replace cells in order to avoid congested regions. Then we allocate appropriate amounts of white space into different regions of the chip according to the congestion map. Finally, a detailed placer is applied to legalize placements while preserving the distributions of white space. Experimental results show that our placement flow can achieve the best routability with the shortest routed wirelength among all publicly available placement tools. Moreover, our white space allocation approach can significantly improve the routabilities of placements generated by other placement tools. Chen Li 0004, Min Xie 0004, Cheng-Kok Koh, Jason Cong, Patrick H. Madden |
ICCAD | 1 |
| 2004 | Recursive bisection based mixed block placementabstractMany current designs contain a large number of standard cells intermixed with larger macro blocks. The range of size in these “mixed block ” designs complicates the placement process considerably; traditional methods produce results that are far from satisfactory. In this paper we extend the traditional recursive bisection standard cell placement tool Feng Shui to directly consider mixed block designs. On a set of recent benchmarks, the new version obtains placements with wire lengths substantially lower than other current tools. Compared to Feng Shui 2.4, the placements of a Capo-based approach have 29 % higher wire lengths, while the placements of mPG are 26 % higher. Run times of our tool are also lower, and the general approach is scalable. Ateen Khatkhate, Chen Li 0004, Ameya R. Agnihotri, Mehmet Can Yildiz, Satoshi Ono, Cheng-Kok Koh, Patrick H. Madden |
ISPD | 2 |