Wire Routing and Satisfiability Planning
نویسندگان
چکیده
منابع مشابه
More on Wire Routing with ASP
Wire routing is an important component in the design of very large scale integrated circuits (VLSI). In a recent work Erdem et al. argued that routing problems can be solved by general-purpose answer-set programming solvers. They proposed to view routing as a planning problem in which multiple robots have to determine their paths between matching pins. As in other planning problems, the represe...
متن کاملWire width planning for interconnect performance optimization
In this paper, we study wire width planning for interconnect performance optimization in an interconnect-centric design flow. We first propose some simplified, yet near-optimal wire sizing schemes, using only one or two discrete wire widths. Our sensitivity study on wire sizing optimization further suggests that there exists a small set of “globally” optimal wire widths for a range of interconn...
متن کاملCurrent-Driven Wire Planning for Electromigration Avoidance in Analog Circuits
Electromigration due to insufficient wire width can cause the premature failure of a circuit. The ongoing reduction of circuit feature sizes has aggravated the problem over the last couple of years, especially with analog circuits. It is therefore an important reliability issue to consider current densities already in the physical design stage. We present a new methodology capable of routing an...
متن کاملDUNE-a multilayer gridless routing system
Advances of very large scale integration technologies present two challenges for routing problems: 1) the higher integration of transistors due to shrinking of featuring size and 2) the requirement for off-grid routing due to the variable-width variable-spacing design rules imposed by optimization techniques. In this paper, we present a multilayer gridless detailed routing system for deep submi...
متن کاملWire Routing and Satis ability Planning
Wire routing is the problem of determining the physical locations of all the wires interconnecting the circuit components on a chip. Since the wires cannot intersect with each other, they are competing for limited spaces, thus making routing a diicult combinatorial optimization problem. We present a new approach to wire routing that uses action languages and satissability planning. Its idea is ...
متن کامل