Conference proceeding
An efficient congestion optimization algorithm for global routing based on search space traversing technology
2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS, pp 114-117
01 Jan 2001
Abstract
]In this paper, we present an efficient congestion optimization algorithm for global routing based on search space traversing technology. In this method, we adopt stochastic optimization, deterministic optimization and local enumeration strategy to dynamically reconstruct the problem structure and make "transition' from a local minimum point, Thus, we can reach other part of the search space, traverse in the whole search space, and obtain the global (approximate) optimal solution. Meanwhile, we shorten the running time. Since any arbitrary initial solution can be accepted, the initialization in our algorithm is greatly simplified. We tested MCNC benchmark circuits and industrial circuits and compared the experimental results with those of typical existing algorithms. It indicates that our algorithm can obtain the global (approximate) optimal solution easily and quickly. Moreover, it can meet the needs of practical applications.
Metrics
6 Record Views
Details
- Title
- An efficient congestion optimization algorithm for global routing based on search space traversing technology
- Creators
- T Jing - Tsinghua UniversityX L HongH Y BaoY C CaiJ Y XuY WangJ Gu
- Contributors
- T TingAo (Editor)Y Huihua (Editor)A Wang (Editor)C K Cheng (Editor)
- Publication Details
- 2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS, pp 114-117
- Publisher
- IEEE
- Number of pages
- 4
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Computer Science
- Web of Science ID
- WOS:000176369900018
- Other Identifier
- 991020638216204721
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