Kahng et al., 2020 - Google Patents
The tao of PAO: Anatomy of a pin access oracle for detailed routingKahng et al., 2020
View PDF- Document ID
- 13486536083960148207
- Author
- Kahng A
- Wang L
- Xu B
- Publication year
- Publication venue
- 2020 57th ACM/IEEE design automation conference (DAC)
External Links
Snippet
Pin accessibility has been widely studied, particularly in recent works that span detailed placement optimization, standard cell layout optimization and new design rule-aware access model. However, to our knowledge, no previous work has described a full solution for pin …
- 241001594857 Pao 0 title description 2
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/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/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/5009—Computer-aided design using simulation
- G06F17/5022—Logic simulation, e.g. for logic circuit operation
-
- 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
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- 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/78—Power analysis and optimization
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2217/00—Indexing scheme relating to computer aided design [CAD]
- G06F2217/70—Fault tolerant, i.e. transient fault suppression
-
- 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
- G06F11/00—Error detection; Error correction; Monitoring
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Kahng et al. | The tao of PAO: Anatomy of a pin access oracle for detailed routing | |
Mantik et al. | ISPD 2018 initial detailed routing contest and benchmarks | |
Liu et al. | NCTU-GR 2.0: Multithreaded collision-aware global routing with bounded-length maze routing | |
US8745565B2 (en) | Satisfying routing rules during circuit design | |
Kahng et al. | TritonRoute: An initial detailed router for advanced VLSI technologies | |
Kahng et al. | Tritonroute: The open-source detailed router | |
Dolgov et al. | 2019 cad contest: Lef/def based global routing | |
TWI472938B (en) | Method of automatically reducing stacked vias in a power network of an integrated circuit | |
WO2013123460A1 (en) | Concurrent placement and routing using hierarchical constraints | |
CN112685988A (en) | Layout environment based cell timing feature analysis | |
GB2522102A (en) | A computer implemented system and method for generating a layout of a cell defining a circuit component | |
EP3953852A1 (en) | Methods and systems to perform automated routing | |
Park et al. | Grid-based framework for routability analysis and diagnosis with conditional design rules | |
Park et al. | ROAD: Routability analysis and diagnosis framework based on SAT techniques | |
Tian et al. | Triple patterning aware detailed placement with constrained pattern assignment | |
Kahng et al. | PROBE: A placement, routing, back-end-of-line measurement utility | |
Sangiovanni-Vincentelli | Automatic layout of integrated circuits | |
Wang et al. | FastPass: Fast pin access analysis with incremental SAT solving | |
Li et al. | Graph-based redundant via insertion and guiding template assignment for DSA-MP | |
Yu et al. | DSA-friendly detailed routing considering double patterning and DSA template assignments | |
Fang et al. | Obstacle-avoiding open-net connector with precise shortest distance estimation | |
Torabi et al. | A fast hierarchical adaptive analog routing algorithm based on integer linear programming | |
Zang et al. | ATLAS: A two-level layer-aware scheme for routing with cell movement | |
Fontana et al. | Towards a reference place and route flow for academic research | |
Marek-Sadowska | Automated Routing for VLSI: Kuh's Group Contributions |