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 52 for “"placement algorithms"”.

  1. Placement algorithms for large-scale heterogeneous FPGAs

    … capability raises ever more challenges to FPGA placement engines. A modern FPGA device consists of heterogeneous logic resources that are unevenly distributed across the layout. This heterogeneity and nonuniformity bring difficulties to achieve smooth and high-quality placement convergences. …

    texas Repository record for Placement algorithms for large-scale heterogeneous FPGAs (opens in a new tab)

  2. Sensor Placement Algorithms for Process Efficiency Maximization

    Even though the senor placement problem has been studied for process plants, it has been done for minimizing the number of sensors, minimizing the cost of the sensor network, maximizing the reliability, or minimizing the estimation errors. In the existing literature, no work has been reported on …

    wvu Repository record for Sensor Placement Algorithms for Process Efficiency Maximization (opens in a new tab)

  3. Replica placement algorithms for efficient internet content delivery.

    … main issues in content delivery with a focus on placement algorithms of replica servers and replica contents. In a content delivery system, the location of replicas is very important as perceived by a quotation: Closer is better. However, considering the costs incurred by replication, it is a …

    adelaide Repository record for Replica placement algorithms for efficient internet content delivery. (opens in a new tab)

  4. Enhancement and Evaluation of Proton Pencil Beam Spot Placement Algorithms

    … improved by implementation of advanced spot placement techniques by moving away from traditional grid-based placements to boundary contoured techniques. We have developed a new optimized spot placement algorithm that provides robust spot distributions inside the target volume by making use of …

    ucf Repository record for Enhancement and Evaluation of Proton Pencil Beam Spot Placement Algorithms (opens in a new tab)

  5. Performance Bounds on Sensor Placement Algorithms and Online Outlier Detection in the Power Grid

    … the suboptimal solutions to the optimal sensor placement problem and also presents algorithms for detecting outliers or malicious data in the power grid. In the sensor placement problem, the number of sensors that can be deployed is often limited by costs and other resource constraints. Finding …

    hawaii Repository record for Performance Bounds on Sensor Placement Algorithms and Online Outlier Detection in the Power Grid (opens in a new tab)

  6. A Completely Parallelizable Analytic Algorithm for Fast and Scalable FPGA Placement

    … the computer aided design flow, including placement, to be both fast and scalable. Unfortunately, as FPGAs continue to grow, compiling the circuits can take hours or days to complete using placement algorithms based on Simulated Annealing (SA). Analytic placement algorithms, such as …

    guelph Repository record for A Completely Parallelizable Analytic Algorithm for Fast and Scalable FPGA Placement (opens in a new tab)

  7. Light probe cloud generation for games

    … of automating the process of virtual light probe placement in a 3D scene. At the moment, probes are placed manually by artists, thus it is consuming time which could be used for other purposes. The primary focus of this research is to find and analyze possible algorithms for placing probes in …

    chalmers Repository record for Light probe cloud generation for games (opens in a new tab)

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

  9. Incremental Design Techniques with Non-Preemptive Refinement for Million-Gate FPGAs

    … to many millions. Core-based incremental placement algorithms, in conjunction with fast interactive routing, are investigated to reduce the design processing time by distinguishing the changes between design iterations and reprocessing only the changed blocks without affecting the …

    vt Repository record for Incremental Design Techniques with Non-Preemptive Refinement for Million-Gate FPGAs (opens in a new tab)

  10. Minimal PMU placement for graph observability: a decomposition approach

    This thesis explores the PMU placement problem, that is, the placement of a minimal number of Phase Measurement Units (PMUs) on the nodes of a power system graph such that the entire graph is observed. The NP-completeness of PMU placement for planar bipartite graphs is shown. PMU placement …

    vt Repository record for Minimal PMU placement for graph observability: a decomposition approach (opens in a new tab)

  11. A Practical Comprehensive Approach to PMU Placement for Full Observability

    In recent years, the placement of phasor measurement units (PMUs) in electric transmission systems has gained much attention. Engineers and mathematicians have developed a variety of algorithms to determine the best locations for PMU installation. But often these placement algorithms are not …

    vt Repository record for A Practical Comprehensive Approach to PMU Placement for Full Observability (opens in a new tab)

  12. Service placement in ad hoc networks

    … such as the World Wide Web (WWW). Service placement is the process of selecting an optimal set of nodes to host the implementation of a service in light of a given service demand and network topology. The main questions addressed by service placement are: How many instances of the same …

    fu-berlin Repository record for Service placement in ad hoc networks (opens in a new tab)

  13. Graphical simulation of articulated rigid body system kinematics with collision detection

    … aid in the testing of ground detection and foot placement algorithms for an articulated walking robot's foot pads on uneven terrain. Several collision detection algorithms and terrain mapping techniques were studied to determine which approach would lend itself readily to the rapid detection of …

    nps Repository record for Graphical simulation of articulated rigid body system kinematics with collision detection (opens in a new tab)

  14. 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)

  15. Timing and Congestion Driven Algorithms for FPGA Placement

    Placement is one of the most important steps in physical design for VLSI circuits. For field programmable gate arrays (FPGAs), the placement step determines the location of each logic block. I present novel timing and congestion driven placement algorithms for FPGAs with minimal runtime overhead. …

    unt Repository record for Timing and Congestion Driven Algorithms for FPGA Placement (opens in a new tab)

  16. A SYSTEM METHODOLOGY FOR FAULT DETECTION AND FAULT RESTORATION IN DISTRIBUTED ELECTRIC POWER SYSTEMS

    … power system. This thesis implements sensor placement algorithms in order to obtain the most information about the state of the system. These algorithms rely on a state estimation algorithm developed in [21] in order to quantify the information obtained by the sensor measurements. Then, the …

    maryland Repository record for A SYSTEM METHODOLOGY FOR FAULT DETECTION AND FAULT RESTORATION IN DISTRIBUTED ELECTRIC POWER SYSTEMS (opens in a new tab)

  17. A Novel Placement Algorithm for the Controllers Of the Virtual Networks (COVN) in SD-WAN with Multiple VNs

    … motivated the researcher to come up with a new placement algorithm for the Controller of Virtual Network (COVN). This is because SDN and network virtualisation techniques (NFV and NV), are integrated to produce multiple virtual networks running on a single SD-WAN infrastructure, which serves the …

    northampton Repository record for A Novel Placement Algorithm for the Controllers Of the Virtual Networks (COVN) in SD-WAN with Multiple VNs (opens in a new tab) Download PDF for A Novel Placement Algorithm for the Controllers Of the Virtual Networks (COVN) in SD-WAN with Multiple VNs (opens in a new tab)

  18. High performance algorithms for large scale placement problem

    <p>Placement is one of the most important problems in electronic design automation (EDA). An inferior placement solution will not only affect the chip’s performance but might also make it nonmanufacturable by producing excessive wirelength, which is beyond available routing resources. Although …

    iastate Repository record for High performance algorithms for large scale placement problem (opens in a new tab)

  19. Wave-Pipelined Multiplexed (WPM) Routing for Gigascale Integration (GSI)

    … study involves designing wire sharing-aware placement algorithms to maximize the advantages of WPM routing. A system-level simulator that designs the entire multilevel interconnect network is developed to perform the system-level analysis. The effect of WPM routing on a full-custom …

    gatech Repository record for Wave-Pipelined Multiplexed (WPM) Routing for Gigascale Integration (GSI) (opens in a new tab)

Page 1 of 3