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 12 of 12 for “"Timing-driven placement"”.

  1. 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 …

    waterloo Repository record for Incremental Timing-Driven Placement with Displacement Constraint (opens in a new tab)

  2. 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 …

    brazil-ufrgs Repository record for A new quadratic formulation for incremental timing-driven placement (opens in a new tab)

  3. An Analytical Timing Driven Placement Tool for Heterogeneous FPGA Architectures

    … without the need for specialized hardware. Placement is a challenging and time-consuming step in the Computer-Aided Design (CAD) process of configuring an FPGA. In this thesis we develop a novel timing-driven analytic placer without explicit packing for Xilinx UltraScale FPGA devices called …

    guelph Repository record for An Analytical Timing Driven Placement Tool for Heterogeneous FPGA Architectures (opens in a new tab)

  4. Hierarchical timing-driven partitioning and placement for symmetrical FPGAs

    … routing delay estimation and hierarchical timing-driven placement to avoid timing problems in FPGAs.

    uiuc Repository record for Hierarchical timing-driven partitioning and placement for symmetrical FPGAs (opens in a new tab)

  5. Nanometer VLSI placement and optimization for multi-objective design closure

    In a VLSI physical synthesis flow, placement directly defines the interconnection, which 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, …

    texas Repository record for Nanometer VLSI placement and optimization for multi-objective design closure (opens in a new tab)

  6. Differentiable timing-driven FPGA placement with smooth optimization and ML-based delay calibration

    Placement is a critical stage in FPGA physical design, determining instance locations 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, …

    texas Repository record for Differentiable timing-driven FPGA placement with smooth optimization and ML-based delay calibration (opens in a new tab)

  7. Algorithms to improve area density utilization, routability and timing during detailed placement and legalization of VLSI circuits

    Placement is a challenging stage in the Very Large-Scale Integration (VLSI) physical design flow. In modern VLSI designs, several design restrictions have been imposed to address the complexity of advanced Complementary Metal-Oxide Semiconductor (CMOS) fabrication nodes. Design restrictions have a …

    brazil-ufrgs Repository record for Algorithms to improve area density utilization, routability and timing during detailed placement and legalization of VLSI circuits (opens in a new tab)

  8. 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 …

    ubc Repository record for Scalable and deterministic timing-driven parallel placement for FPGAs (opens in a new tab) Download PDF for Scalable and deterministic timing-driven parallel placement for FPGAs (opens in a new tab)

  9. Incremental placement for modern VLSI design closure

    … VLSI design closure demands advanced incremental placement techniques. In this dissertation, I proposed several novel incremental placement methods for design closure objectives such as timing, signal integrity, legalization, and total wirelength (TWL). These methods can be applied to any physical …

    texas Repository record for Incremental placement for modern VLSI design closure (opens in a new tab)

  10. Deterministic, Weak-scaling Parallelism for Wirelength- and Timing-driven FPGA Placement, Suitable for Multicore and Manycore Architectures

    … time for FPGA designs is spent performing placement (which is NP-hard). Serial simulated annealing is typically used for placement in practice, where runtime unfortunately grows exponentially with circuit size to be placed. Therefore, development of parallel placement algorithms that can …

    guelph Repository record for Deterministic, Weak-scaling Parallelism for Wirelength- and Timing-driven FPGA Placement, Suitable for Multicore and Manycore Architectures (opens in a new tab)

  11. Timing optimization techniques for scalable physical synthesis of digital integrated circuits

    … and route a design that satisfies the required timing, area and power constraints. Then, comes efficiency that allows executing physical synthesis algorithms in the least amount of time even for very large designs. This thesis tackles exactly those two contradicting goals focusing on timing …

    greece Repository record for Timing optimization techniques for scalable physical synthesis of digital integrated circuits (opens in a new tab)

  12. A Machine Learning Model to Predict Maximum Clock Frequency During FPGA Placement

    Placement is one of the most challenging tasks in the 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 …

    guelph Repository record for A Machine Learning Model to Predict Maximum Clock Frequency During FPGA Placement (opens in a new tab)