Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 45 for “"Timing Driven"”.
-
Timing Driven Analytical Placement for FPGA
… this thesis, we propose a new fast and efficient timing driven analytical placement engine targeted at global placement for FPGAs followed by low temperature SA for detailed placement. Our global placement engine uses quadratic programming approach to minimize the wirelength and dynamic net …
-
Incremental Timing-Driven Placement with Displacement Constraint
… delays are becoming major limiting factor for timing closure. Traditional placement algorithms such as routability-driven placement (improves routability) and wirelength- driven placement (reduces total wirelength) are no longer sufficient to close timing. To this end, timing-driven placement …
-
Timing-driven optimization problems in VLSI CAD
… of VLSI circuits, with the satisfaction of timing constraints as the primary objective. We focus on problems where the underlying architecture is regular. Field Programmable Gate Arrays (FPGAs), identical standard cell based architectures and WSI arrays of blocks having a regular structure …
-
Scalable and deterministic timing-driven parallel placement for FPGAs
… describes a parallel implementation of the timing-driven VPR 5.0 simulated-annealing placement engine. By partitioning the grid into regions and allowing distant data to grow stale, it is possible to consider a large number of non-conflicting moves in parallel and achieve a deterministic …
-
A new quadratic formulation for incremental timing-driven placement
… delay is a dominant factor for achieving timing closure in nanoCMOS circuits. During physical synthesis, placement aims to spread cells in the available area while optimizing an objective function w.r.t. the design constraints. Therefore, it is a key step to determine the total wirelength …
-
Hierarchical timing-driven partitioning and placement for symmetrical FPGAs
… routing delay estimation and hierarchical timing-driven placement to avoid timing problems in FPGAs.
-
An Analytical Timing Driven Placement Tool for Heterogeneous FPGA Architectures
… an FPGA. In this thesis we develop a novel timing-driven analytic placer without explicit packing for Xilinx UltraScale FPGA devices called GPlace4.0. Our placement algorithms simultaneously optimizes for the conflicting objectives of wirelength, timing and routability throughout the flow. …
-
Detailed-routability-driven and timing-driven scalable parallel global routing
… is considered, (2) routing is fast, and (3) timing constraints are satisfied. This dissertation proposes new algorithms as well as novel parallelization strategies to improve both the quality of result (QoR) and the runtime of global routing. The following work is presented in this …
-
Timing-driven physical design EDA algorithms for tackling process variations
… algorithm, SCPlace, which based on a statistical timing modelin its optimization engine, alleviates the need for multi-corner placement. SCPlace is the first large-scale statistical optimization tool appearing in literature targeting placement, which is thecornerstone of physical implementation. …
-
Differentiable timing-driven FPGA placement with smooth optimization and ML-based delay calibration
… within available device resources. FPGA timing-driven placement aims to minimize routed wirelength while optimizing timing metrics such as total negative slack (TNS) and worst negative slack (WNS). In this work, we propose a differentiable timing-driven FPGA placement framework, enabling …
-
Discrete gate sizing and timing-driven detailed placement for the design of digital circuits
… EDA problems are addressed: gate sizing and timing-driven detailed placement. They are studied and new techniques developed. For gate sizing, a new Lagrangian-relaxation methodology is presented based on local timing information and sensitivity propagation. For timing-driven detailed …
-
Deterministic, Weak-scaling Parallelism for Wirelength- and Timing-driven FPGA Placement, Suitable for Multicore and Manycore Architectures
… also propose the first scalable algorithms for timing analysis, which are ideally suited for modern manycore architectures, such as GPUs. Our experimental results show that our proposed wirelength- and timing-driven placement tools achieve mean absolute runtime improvements of 19x and 31x, …
-
Power and Timing Driven Optimal Gate, Clock Buffer and Clock Wire Sizing in High Performance Digital Integrated Circuits
… the trade-off between the power consumption and timing metrics of digital integrated circuits. With the increasing demands for mobile devices and low power technologies, the power consumption has become as important as the timing performance for the integrated circuit designers. However, finding …
-
TIME-MULTIPLEXED INTERCONNECTION NETWORK FOR FIELD-PROGRAMMABLE GATE ARRAYS
… account for a large part of the area and timing budget. Given the significant intra- clock cycle idleness of wire segments in conventional architecture, we in this work propose TM-ARCH, a time-multiplexed architecture for FPGA interconnects. In this architecture, a wire can be multiplexed …
-
A Machine Learning Model to Predict Maximum Clock Frequency During FPGA Placement
… computer-aided design (CAD) flow of the FPGA. Timing-driven is a placement flow that aims to place a design in a way that reaches a specific clock frequency after routing. The actual frequency of a design is heavily dependent on the placement strategy. However, it can only be exactly determined …
-
Nanometer VLSI placement and optimization for multi-objective design closure
… affects many other design objectives, such as timing, power consumption, congestion, and thermal issues. With the scaling of technology, the relative interconnect delay increases dramatically. As a result, placement has become a bottleneck in deep sub-micron physical synthesis. In this …
-
Layer assignment and routing optimization for advanced technologies
… it becomes increasingly challenging to achieve timing closure for VLSI design. Since a complete design flow consists of several phases, such as logic synthesis, placement, and routing, interconnect synthesis plays an important role which includes buffer insertion/sizing and timing-driven …
-
An efficient and accurate timing macro-modeling algorithm for large hierarchical designs
… algorithms to accelerate hierarchical timing. We introduce LibAbs, an effective macro-modeling algorithm that efficiently supports high accuracy, high compression rate, and multi-threading. LibAbs applies tree-based graph reduction techniques to reduce the model size with accuracy …
-
Timing-Aware Automatic Floorplanning of Partially Reconfigurable Designs for Accelerating FPGA Productivity
… of debug logic. Automatic generation of a timing-driven floorplan for a partially reconfigurable design aims to remove the need for implementation iterations to meet all constraints. Floorplan speculation may anticipate small changes to a design. Although PATIS supports incremental design, …
Page 1 of 3