[go: up one dir, main page]

Nieberg, 2011 - Google Patents

Gridless pin access in detailed routing

Nieberg, 2011

Document ID
11958777732805129103
Author
Nieberg T
Publication year
Publication venue
Proceedings of the 48th Design Automation Conference

External Links

Snippet

In the physical design of VLSI circuits, routing is one of the most important tasks. Usually done towards the end of the design process, especially the detailed routing phase has to obey virtually all design rules. As the feature size become ever smaller, shifts towards …
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/5086—Mechanical design, e.g. parametric or variational design
    • 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
    • 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
    • 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
    • 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
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • 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

Similar Documents

Publication Publication Date Title
Nieberg Gridless pin access in detailed routing
Pan et al. FastRoute 2.0: A high-quality and efficient global router
US7594214B1 (en) Maximum flow analysis for electronic circuit design
Gester et al. BonnRoute: Algorithms and data structures for fast and good VLSI routing
Pan et al. FastRoute: A step to integrate global routing into placement
US8291365B2 (en) Conditionally routing a portion of an integrated circuit design with a different pitch to overcome a design rule violation
Sarrafzadeh et al. Modern placement techniques
Chen et al. Full-chip routing considering double-via insertion
Ahrens et al. Detailed routing algorithms for advanced technology nodes
Li et al. Guiding a physical design closure system to produce easier-to-route designs with more predictable timing
Cortadella et al. A boolean rule-based approach for manufacturability-aware cell routing
Ho et al. Multilevel full-chip routing for the X-based architecture
US7657860B1 (en) Method and system for implementing routing refinement and timing convergence
Jia et al. A multicommodity flow-based detailed router with efficient acceleration techniques
Chen et al. Novel full-chip gridless routing considering double-via insertion
Posser et al. Challenges and approaches in VLSI routing
Su et al. Nanowire-aware routing considering high cut mask complexity
Gester et al. Algorithms and data structures for fast and good VLSI routing
Liu et al. Chip-level area routing
Tang et al. Technology migration techniques for simplified layouts with restrictive design rules
US7614028B1 (en) Representation, configuration, and reconfiguration of routing method and system
Law et al. Block alignment in 3D floorplan using layered TCG
Goncalves et al. SmartDR: Algorithms and techniques for fast detailed routing with good design rule handling
Fang et al. Obstacle-avoiding open-net connector with precise shortest distance estimation
Scheffer Routing