Graph-based STA for asynchronous controllers
| Autor: | Stavros Simoglou, Nikolaos Xiromeritis, Nikolaos Sketopoulos, Christos Sotiriou |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Marked graph
Computer science 020208 electrical & electronic engineering Spice Static timing analysis Hardware_PERFORMANCEANDRELIABILITY 02 engineering and technology Petri net Topology 020202 computer hardware & architecture Hardware and Architecture Asynchronous communication Netlist Hardware_INTEGRATEDCIRCUITS 0202 electrical engineering electronic engineering information engineering Verilog Graph (abstract data type) Electrical and Electronic Engineering Algorithm computer Critical path method Software computer.programming_language Hardware_LOGICDESIGN Asynchronous circuit |
| Zdroj: | PATMOS |
| ISSN: | 0167-9260 |
| DOI: | 10.1016/j.vlsi.2020.05.005 |
| Popis: | In this work, we present an Asynchronous Static Timing Analysis (ASTA) EDA methodology for cyclic, Asynchronous Control Circuits. Our methodology operates using Graph-based Analysis (GBA) principles, as conventional synchronous GBA STA, is fast, and pessimistically computes Critical Cycle(s), instead of Critical Paths, without cycle cutting. Our ASTA flow supports industrial Timing Libraries, Verilog input and multiple PVT corners. Gate timing arc delay/slew computation, input/output environment constraints, and path delay propagation, are implemented based on GBA STA principles. To perform ASTA, both gate-level netlist and a graph-based Event Model, Marked Graph (MG) or PeTri Net (PTnet), is required. The pair is used to construct the Event Timing Graph (ETG), an MG with annotated netlist extracted delays, for Event Model Transition to Transition (T2T) arcs. ETG delays are computed automatically, based on cyclic equilibrium slews, and GBA critical path identification between relevant T2T netlist gate pins. GBA T2T paths may be manually overridden. As GBA is non-functional, we illustrate a mapping between an Event Model, where choice places may be allowed, and the ETG, where places are collapsed to their corresponding timing annotated T2T arcs. The resultant ETG is live and 1-bounded, making it suitable for Period analysis using Burns Primal-Dual Algorithm. Our methodology has been successfully tested on 23 asynchronous benchmarks, and validated via timing simulation. We compare results against an industrial, synchronous STA tool with cycle cutting, and illustrate significant timing errors, when synchronous STA is used for delay annotation, as well as a 50% delta in Critical Cycle Delay. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect