Tien-Yueh Liu

dblp:375/8435 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

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

Systems, architecture and hardware · 1

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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › placement › module placement
macro placement
0.112008
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2008
Electronic design automation › physical design › placement
mixed-size placement
0.112008
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2008
Electronic design automation
physical design
0.112008
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2008
Electronic design automation › physical design
placement
0.112008
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2008
Electronic design automation › physical design › routing › routability
routability optimization
0.012008
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2008

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

multipacking-tree representation · 0.1displacement minimization · 0.1binary tree packing · 0.1
YearPublicationVenuePosition
2008 MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs
abstract
In this paper, we present a new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rates. Based on binary trees, the MP-tree is very efficient, effective, and flexible for handling macro placements with various constraints. Given a global placement that already considers the areas and the interconnections among standard cells and macros, our MP-tree-based macro placer optimizes macro positions, minimizes the macro displacement from the initial macro positions, and maximizes the area of the chip center for standard-cell placement and routing. Experiments based on the Proceedings of the 2006 International Symposium on Physical Design placement contest benchmarks and Faraday benchmarks show that our macro placer combined with APlace 2.0, Capo 10.2, mPL6, or NTUplace3 for a standard-cell placement outperforms these state-of-the-art academic mixed-size placers alone by large margins in robustness and quality. In addition to wirelength, experiments on four real industrial designs with large macros and high utilization rates show that our method significantly reduces the average half-perimeter wirelength by 35 %, the average routed wirelength by 55 %, and the routing overflows by 13 times compared with Capo 10.2, implying that our macro placer leads to much higher routability.
Tung-Chieh Chen, Ping-Hung Yuh, Yao-Wen Chang, Fwu-Juh Huang, Tien-Yueh Liu
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.5