Conference proceeding
Methods of improving rout ability in timing-driven placement
2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS, pp 110-113
01 Jan 2001
Abstract
How to decrease the maximum delay and how to improve the rout ability are two important goals in the placement algorithm. But there are some conflicts between the two goals. In this paper, we provide two heuristic methods to reach the two goals during the global placement stage. In both of the two methods, the algorithms include two steps. We try to decrease the maximum delay in the first step, then in the next step we adjust the cells' position in the local area to improve the rout ability. We have tested our two algorithms in two real circuits. And the results show that the maximum delay and the number of the critical paths do not increase a lot, and the rout ability improved.
Metrics
9 Record Views
Details
- Title
- Methods of improving rout ability in timing-driven placement
- Creators
- W T HouX L HongW M WuY C Cai
- Contributors
- T TingAo (Editor)Y Huihua (Editor)A Wang (Editor)C K Cheng (Editor)
- Publication Details
- 2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS, pp 110-113
- Publisher
- IEEE
- Number of pages
- 4
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Computer Science
- Web of Science ID
- WOS:000176369900017
- Other Identifier
- 991020638369204721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Computer Science, Information Systems
- Engineering, Electrical & Electronic
- Telecommunications