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 30 for “"Placement algorithm"”.
-
A combined clustering and placement algorithm for FPGAs
… speed disadvantage, this thesis presents a novel algorithm to improve timing performance at the possible expense of area and runtime. The algorithm presented leverages node duplication and a depth-optimal initial clustering to provide a starting point for a non-greedy, iterative optimization …
-
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 …
-
Improved Algorithms for Cell Placement and Their Parallel Implementations
… In this thesis, we present a novel VLSI placement algorithm (APT: An area-performance-testability driven placement algorithm) to produce a placement that not only meets the area requirement of the circuit but also meets the timing and the testability requirements as well. In APT, the …
-
Performance-driven placement and routing algorithms
… we developed a net-based performance driven placement algorithm and a path-based performance driven placement algorithm. As chip architectures become more specific (e.g., FPGA), it is important to consider the physical design information during logic design steps. Therefore, we developed a …
-
Sensor placement for microseismic event location
… of a mine design. A robust localization algorithm is used to estimate the source position of the microseismic event by selecting the hypothesized source location that maximizes an energy function generated from the sum of the time--aligned sensor signals. The accuracy of localization for …
-
Map-assisted Indoor Positioning Utilizing Ubiquitous WiFi Signals
… Firstly, considering the access point (AP) placement is the first step to deploy indoor positioning system using WiFi, an AP placement algorithm is provided to generate the placement of APs in a given indoor environment. The AP placement algorithm utilises the floor plan information from the …
-
Efficient Routing in the CityMesh Decentralized Fallback Wireless Network
… network segments by formulating a relay placement strategy based on map data and geometric heuristics. Additionally, to reconnect fragmented network segments, we develop a practical relay placement algorithm by leveraging on the convex hull optimization and re-using global map knowledge, …
-
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 …
-
Machine Learning for Performance Aware Virtual Network Function Placement
… addresses the Virtual Network Function (VNF) placement problem through the development of a machine learning-based Delay-Aware Tree (DAT) which learns from the previous placement of VNF instances forming a Service Function Chain. The DAT is able to predict VNF instance placements with an …
-
Optimizing interactive analytics engines for heterogeneous clusters
… Getafix, an intelligent data replication and placement algorithm, and optimizes Getafix for running mixed queries over a heterogeneous cluster. The new algorithm is called Getafix-H, a cluster aware version of Getafix replication algorithm, with built-in optimizations for segment balancing and …
-
Placement for fast and reliable through-silicon-via (TSV) based 3D-IC layouts
… (3D ICs) that use through-silicon vias (TSVs) at placement stage. Four main works that support this goal are included. In the first work, wirelength of TSV-based 3D ICs is the main focus. In the second work, stress-induced carrier mobility variation in TSV-based 3D ICs is examined. In the third …
-
Probabilistic approaches to the design of wireless ad hoc and sensor networks
… and movement of objects, an optimal sensor placement algorithm is proposed by adaptively learn the dynamical object distribution. Moreover, dynamical boundary of mass objects monitored in a sensor network can be estimated based on the unsupervised learning of the distribution density of …
-
Applications of phasor measurements to the real-time monitoring of a power system
… Adjustments to a previously developed PMU placement algorithm are described which observe generator and tie line flows explicitly and reduces the number of PMUs required for a system, still observing the major dynamic components of a system. This adjusted methodology leaves some buses …
-
Adaptive communication networks for heterogeneous teams of robots
… their primary coordination task. We develop algorithms and performance guarantees for maintaining a desired communication quality over the entire heterogeneous team of controlled mobile routers and non-cooperative clients. In the first part of the thesis we consider the problem of router …
-
Physical Design for Multichip Modules
… (MCM) environment: interconnect analysis, chip placement, global tree construction, and layer assignment. The emphasis is on maximizing the electrical performance, based on accurate modeling of MCM interconnect behavior. A new approach, called Reciprocal Expansion, is developed for rapidly …
-
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 …
-
A game-theoretic approach to the security of emerging cognitive radio and small cell networks
… we propose a novel secure channel selection algorithm that enables the SUs and eavesdroppers to take distributed decisions so as to reach a Nash equilibrium point. Then, we solve the same problem using a different approach and under a different set of assumptions. Here, the SUs aim at …
-
Resource Allocation Schemes And Performance Evaluation Models For Wavelength Division Multiplexed Optical Networks
… optical networks. A new approach for the sparse placement of full wavelength converters based on the concept of the k-Dominating Set (k-DS) of a graph is presented. The k-DS approach is also extended to the case of limited conversion capability using three scalable and cost-effective switch …
-
Application of characteristic mode analysis to variable antenna placement on devices operating in the near -resonant range
… approach for determining optimal antenna placement within such near-resonant range systems does not exist. Previously, characteristic mode analysis had only been applied to systems with constant geometry that operated in the near-resonant range and the system had constant characteristic …
-
A service-oriented approach to topology formation and resource discovery in wireless ad-hoc networks
… We refer to this scheme as the Service Directory Placement Algorithm, or SDPA. We formulate the directory relocation problem as a Markov Decision Process that is solved by using Q-learning. Performance evaluations through computer simulations reveal bandwidth overhead reductions that range between …
Page 1 of 2