Parallel processor implementation of net routing

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

39550008, G06F 1750

Patent

active

059305002

ABSTRACT:
A method for maximizing effectiveness of parallel processing, using multiple processors, to connect pins of a net of an integrated circuit is disclosed. The method requires the pins to be partitioned into sets of pins and the sets of pins to be further partitioned into meta-sets of the sets of pins. The sets and the meta-sets are connected using a minimal spanning tree algorithm, and the connected sets are made to share a pin, thereby ensuring that the whole net is interconnected without creating a loop in the routing. In addition, because the partitions and the sets of partitions average approximately the same number of pins, the work load can easily be balanced between the processors.

REFERENCES:
patent: 4630219 (1986-12-01), DiGiacomo et al.
patent: 4858143 (1989-08-01), Fournier
patent: 4908772 (1990-03-01), Chi
patent: 5202840 (1993-04-01), Wong
patent: 5590063 (1996-12-01), Golio et al.
patent: 5682321 (1997-10-01), Ding et al.
patent: 5798936 (1998-08-01), Cheng
Mayrhofer et al., "Congestion-Driven Placement Using a New Multi-Partitioning Heuristic," 1990 IEEE, pp. 332-335, 1990.
Tragoudas, "Min-Cut Partitioning on Underlying Tree and Graph Structures," 1996 IEEE, pp. 470-474, 1996.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Parallel processor implementation of net routing does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Parallel processor implementation of net routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel processor implementation of net routing will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-890089

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.