Boots – shoes – and leggings
Patent
1996-06-21
1998-08-25
Voeltz, Emanuel Todd
Boots, shoes, and leggings
364490, 364491, G06F 1750, G06F 1710
Patent
active
057989362
ABSTRACT:
Hierarchical look-ahead congestion-driven placement is a look-ahead method for avoiding interconnect congestion. It balances the available routing resources. When incorporated into conventional quadratic programming approaches, only minor increases in run-time are needed to produce dramatic decreases in congestion. The macrocell densities are traded between adjacent regions to anticipate congestion, and are estimated based on the current iteration for the distribution of cells and net connections involved. The congestion estimation also takes routing detour due to the presence of large hard macros into account for accuracy. The macrocell density adjustments are propagated to all the neighboring regions at each hierarchical level to revise the prior congestion estimate from the previous hierarchical iteration.
REFERENCES:
patent: 5267176 (1993-11-01), Antreich et al.
patent: 5506788 (1996-04-01), Cheng et al.
patent: 5587923 (1996-12-01), Wang
patent: 5657242 (1997-08-01), Sekiyama et al.
patent: 5699265 (1997-12-01), Scepanovic et al.
Natesan et al. ("Clock-skew constrained cell placement", IEEE Comput. Soc. Press, Proceedings of 9th International Conference on VLSI Design, 3 Jan. 1996, pp. 146-149).
Kleinhans et al. ("Gordian: VLSI placement by quadratic programming and slicing optimization", IEEE Transaction on Computer-Aided Design of Integrated Circuits and Systems, vol. 10, Issue 3, Mar. 1991, pp. 356-365).
Mayrhofer et al. ("Congestion-driven placement using a new multi-partitioning heuristic", IEEE Comput. Soc. Press, IEEE International Conference on Computer-Aided Design, 11 Nov. 1990, pp. 332-335).
Takahashi et al. ("Min-cut placement with global objective functions for large scale sea-of-gates arrays", IEEE Transaction on Computer-Aided Design of Integrated Circuits and Systems, vol. 14, issue 4, Apr. 1995, pp. 434-446).
Yan ("Two-way balance-tolerant partitioning based on fuzzy graph clustering for hierarchical design og VLSI systems", IEEE, Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix Conference on Computers and Communications, 28 Mar.
Yan ("Area-ratio-constrained min-cut partitioning for row-based placement", IEEE, Proceedings of the 37th Midwest Symposium on Circuits and Systems, 3 Aug. 1994, pp. 403-406).
Avant! Corporation
Kik Phallaka
Schatzel Thomas E.
Todd Voeltz Emanuel
LandOfFree
Congestion-driven placement method and computer-implemented inte does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Congestion-driven placement method and computer-implemented inte, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Congestion-driven placement method and computer-implemented inte will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-40668