Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
2000-05-18
2002-11-19
Smith, Matthew (Department: 2825)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000, C716S030000
Reexamination Certificate
active
06484298
ABSTRACT:
FIELD OF THE INVENTION
The present invention generally relates to computer-assisted design of electronic circuits, and more particularly to automating timing-driven optimizations in various phases of implementing a circuit design.
BACKGROUND
The place and route phases of implementing a circuit design generally involve generating a layout of the circuit elements on a chip and defining the signal lines that connect the elements. To satisfy various physical design requirements, the circuit layout is typically optimized based on physical resources. For example, optimization of the layout can be based on resources such as area and wire length. That is, it is desirable for the circuit to occupy the smallest area possible and the smallest possible total wire length.
Performance requirements for a circuit are also considered during the place and route phases. The required performance of a circuit is typically specified by a user and is expressed as the required frequency. This requirement translates to a maximum allowable delay for paths between boundary elements, for example, flip-flops. The maximum path delay that is acceptable is a timing constraint parameter that is provided to the place and route processes.
When place-and-route is performed without regard for timing constraints, a valid placed and routed design can be generated relatively quickly. However, since timing constraints are not considered, the result may not satisfy the performance requirements. When timing constraints are introduced to the place-and-route processes, the placer and router perform delay-driven optimization, which requires a much longer runtime.
In conjunction with the long runtimes associated with delay-driven optimization, the process of maximizing the performance of a circuit may be an iterative process. That is, a designer may choose an initial timing constraint, run the placer and router, and if the design was successfully placed and routed, repeat the process using a tighter timing constraint. However, the next iteration of the process using the new timing constraint may not be feasible, thereby wasting a considerable amount of time in rerunning the placer and router. Alternatively, placing and routing under the new timing constraint may leave room for even further improvement in the performance, thereby requiring another iteration of the process with a further tightened timing constraint. It can be seen that creating a placed and routed design with optimal performance can be a time-consuming process.
A method and apparatus that address the aforementioned and related problems in the place-and-route phases of implementing a circuit design, as well as in other phases of implementation, are therefore desirable.
SUMMARY OF THE INVENTION
In various embodiments, a method and apparatus are provided for automatic, timing-driven optimization in various phases of implementing a circuit design. The timing constraint that is applied during different phases of implementation is dynamically varied in order to improve circuit performance. The processes and apparatus allow automation of the task of determining a circuit's maximum performance. In general, the process begins by determining the timing performance of a given layout. The process then automatically determines a new, tighter timing constraint. In one embodiment, a selected portion of the connections becomes critical in choosing the new, tighter timing constraint. The new timing constraint is then applied in producing a new layout. Slack values associated with paths in the placed/routed design are used in deriving the new timing constraint from the selected number of critical connections.
It is observed that the level of difficulty associated with a timing constrained place-and-route is proportional to the number of connections in a design that are critical. Making a connection “critical” refers to setting a new timing constraint such that the delay of at least one path passing through the connection is greater than the time associated with the timing constraint. To automatically adjust the timing constraint, a selected number of the connections are deemed to be critical. That is, a new timing constraint is chosen such that signal paths through the desired number of connections will become critical in the next iteration of placing or routing the design. By gradually and automatically tightening the timing constraint as a function of a number of critical connections, in the place-and-route phase as well as in other phases of the implementation, a designer's time as well as computation time can be saved.
Various other embodiments are set forth in the Detailed Description and claims which follow.
REFERENCES:
patent: 5422317 (1995-06-01), Hua et al.
patent: 5778216 (1998-07-01), Venkatesh
patent: 5901063 (1999-05-01), Chang et al.
patent: 5953236 (1999-09-01), Hossain et al.
patent: 6192508 (2001-02-01), Malik et al.
patent: 6216252 (2001-04-01), Dangelo et al.
patent: 6230304 (2001-05-01), Groeneveld et al.
patent: 6233724 (2001-05-01), LaBerge
patent: 6286128 (2001-09-01), Pileggi et al.
Anderson Jason H.
Chari Madabhushi V. R.
Chaudhary Kamal
Kalman Sandor S.
Nag Sudip K.
Dinh Paul
Maunu LeRoy D.
Smith Matthew
Xilinx , Inc.
LandOfFree
Method and apparatus for automatic timing-driven... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for automatic timing-driven..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for automatic timing-driven... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2979486