[go: up one dir, main page]

Khasawneh et al., 2019 - Google Patents

Hydraroute: A novel approach to circuit routing

Khasawneh et al., 2019

Document ID
15752725401544751597
Author
Khasawneh M
Madden P
Publication year
Publication venue
Proceedings of the 2019 Great Lakes Symposium on VLSI

External Links

Snippet

Routing for dense circuits is a major challenge for VLSI physical design. Most routing approaches rely at least partially on a" rip-up and reroute" scheme, where solution quality and run times can be impacted profoundly by the order in which nets are routed. Other …
Continue reading at dl.acm.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5077—Routing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5072—Floorplanning, e.g. partitioning, placement
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5081—Layout analysis, e.g. layout verification, design rule check
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G06F17/5036—Computer-aided design using simulation for analog modelling, e.g. for circuits, spice programme, direct methods, relaxation methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5045—Circuit design
    • G06F17/505—Logic synthesis, e.g. technology mapping, optimisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G06F2217/12—Design for manufacturability
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G06F2217/08—Multi-objective optimization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring

Similar Documents

Publication Publication Date Title
US8386984B2 (en) Interconnect routing methods of integrated circuit designs
US7137097B1 (en) Constraint-based global router for routing high performance designs
Mulpuri et al. Runtime and quality tradeoffs in FPGA placement and routing
US20030005398A1 (en) Timing-driven global placement based on geometry-aware timing budgets
US6353918B1 (en) Interconnection routing system
Gester et al. BonnRoute: Algorithms and data structures for fast and good VLSI routing
US9177093B2 (en) Routing interconnect of integrated circuit designs with varying grid densities
Khasawneh et al. Hydraroute: A novel approach to circuit routing
Dewan et al. Construction of all multilayer monolithic rsmts and its application to monolithic 3d ic routing
Rafiq et al. Integrated floorplanning with buffer/channel insertion for bus-based microprocessor designs
Cheng et al. Obstacle-avoiding length-matching bus routing considering nonuniform track resources
Qi et al. VFGR: A very fast parallel global router with accurate congestion modeling
Lee et al. A global router for sea-of-gates circuits
Kheterpal et al. Routing architecture exploration for regular fabrics
Agnihotri et al. Congestion reduction in traditional and new routing architectures
Cha et al. A simple and effective greedy multilayer router for MCMs
Huang et al. On Legalization of Die Bonding Bumps and Pads for 3-D ICs
Arslan et al. A depth-first-search controlled gridless incremental routing algorithm for VLSI circuits
He et al. A Pad-focused PCB Routing Algorithm Using Polygon-based Dynamic Partitioning
Lee et al. Wire type assignment for FPGA routing
Fontana et al. Towards a reference place and route flow for academic research
Minz et al. Channel and Pin Assignment for Three Dimensional Packaging Routing
Swartz Issues in global routing
Xu et al. Redundant local-loop insertion for unidirectional routing
Ozdal et al. Global routing formulation and maze routing