Run-time efficient methods for routing large multi-fanout nets

Details Run-time efficient methods for routing large multi-fanout nets Run-time efficient methods for routing large multi-fanout nets

2008-03-18

2009-11-17

Chiang, Jack (Department: 2825)

Computer-aided design and analysis of circuits and semiconductor

Nanotechnology related integrated circuit design

C716S030000, C716S030000

Reexamination Certificate

active

07620923

ABSTRACT:
A method of limiting the routing resources of an integrated circuit (IC) that are available for use when routing multi-fanout nets can include selecting a multi-fanout net comprising a source and a plurality of loads and identifying each region of the IC which does not include at least one of the plurality of loads. Each of the regions can have a defined geometry. A type of routing resource can be selected which has a physical orientation with respect to the IC that corresponds to the geometry of the regions of the IC. Each routing resource of the selected type that is located within a region of the IC which does not include at least one of the plurality of loads can be excluded from consideration when routing the multi-fanout net.

REFERENCES:
patent: 4831725 (1989-05-01), Dunham et al.
patent: 6247167 (2001-06-01), Raspopovic et al.
patent: 7080342 (2006-07-01), Teig et al.
patent: 7089524 (2006-08-01), Teig et al.
patent: 7171635 (2007-01-01), Teig et al.
patent: 7398498 (2008-07-01), Teig et al.
patent: 2001/0018759 (2001-08-01), Andreev et al.
patent: 2003/0005155 (2003-01-01), Carbonell et al.
patent: 2003/0063614 (2003-04-01), Teig et al.
patent: 2003/0074645 (2003-04-01), Clabes et al.
patent: 2004/0117753 (2004-06-01), Kahng et al.
patent: 2004/0216072 (2004-10-01), Alpert et al.
patent: 2005/0166164 (2005-07-01), Ren et al.
patent: 2005/0229137 (2005-10-01), Ito
Hu et al., “A Survey on Multi-net Global Routing for Integrated Circuits”; 2001; Integration, the VLSI Journal; pp. 1-49.
Sapatnekar et al., “ A Timing-Constrained Simultaneous Global Routing Algoritm”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 21, No. 9, Sep. 2002, pp. 1025-1036.
Spruth et al., “Parallel Routing of VLSI Circuits Based on Net Independency”, IEEE, 1994, pp. 949-953.
Chiang et al., “Global Routing Based on Steiner Min-Max Trees”, IEEE Transactions on Computer-Aided Design, vol. 9, No. 12, Dec. 1990, pp. 1318-1325.
Cheng et al.; “RISA: Accurate and Efficient Placement Routability Modeling”; 1994; ACM, Cadence Design Systems; pp. 1-6.
Betz et al.; “VPR: A New Pakcing, Placement and Routing Tool for FPGA Research”; 1997; International Workshop on Field Programmable Logic and Applications, Department of Electrical and Computer Engineering, University of Toronto; pp. 1-10.
U.S. Appl. No. 11/119,012, filed Apr. 29, 2005, Kong et al.
U.S. Appl. No. 12/050,447, filed Mar. 18, 2008, Kong et al.
Betz, Vaughn et al., “VPR: A New Packing, Placement and Routing Tool for FPGA Research,” 7th International Workshop on Field Programmable Logic and Applications (FPL'97), Sep. 1-2, 1997, pp. 1-10, London, UK.
Lee, C. Y., “An Algorithm for Path Connections and its Applications,”IRE Transactions on Electronic Computers, Sep. 1961, pp. 346-365, vol. EC-10, No. 3.
McMurchie, Larry et al., “PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs,” Proceeding of the 3rdInternational ACM Symposium on Field-Programmable Gate Arrays (FPGA'95), Feb. 12-14, 1995, pp. 111-117, Monterey, California, USA.
Preas, Bryan T. et al., “Physical Design Automation of VLSI Systems,” copyright 1988, pp. 163-165, The Benjamin/Cummings Publishing Co, Inc., San Francisco, California, USA.
Xilinx, Inc., “Virtex-II Platform FPGA Handbook,” Dec. 2000, pp. 33-75, Xilinx, Inc., 2100 Logic Drive, San Jose, California 95124, USA.

Affiliated with

Also associated with

Rating

Run-time efficient methods for routing large multi-fanout nets does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Run-time efficient methods for routing large multi-fanout nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Run-time efficient methods for routing large multi-fanout nets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4127351