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 327 for “"Routing algorithms"”.

  1. Initial detailed routing algorithms

    … this work, we present a study of the problem of routing in the context of the VLSI physical synthesis flow. We study the fundamental routing algorithms such as maze routing, A*, and Steiner tree-based algorithms, as well as some global routing algorithms, namely FastRoute 4.0 and BoxRouter 2.0. …

    brazil-ufrgs Repository record for Initial detailed routing algorithms (opens in a new tab)

  2. A Survey of Qubit Routing Algorithms

    … process in performing quantum experiments. Routing is a particularly important and computationally expensive part of the transpilation process. The routing process can alter a circuit’s accuracy, execution time, quantum gate count, and depth. Several routing algorithms exist that aim to …

    rit Repository record for A Survey of Qubit Routing Algorithms (opens in a new tab)

  3. Routing algorithms for electronic design automation

    In electronic design automation (EDA), routing is one of the most important tasks for both printed circuit boards (PCB) and integration circuits (IC). After placement, which determines the location of each component on a PCB or element of an IC, the routing step adds wires needed to properly …

    uiuc Repository record for Routing algorithms for electronic design automation (opens in a new tab)

  4. Performance-driven placement and routing algorithms

    … track permutation algorithm for gridded channel routing problems. We also developed a wire segment assignment algorithm for both channel routing problems and switchbox routing problems. The experimental results indicate that our algorithms are very promising.

    uiuc Repository record for Performance-driven placement and routing algorithms (opens in a new tab)

  5. Routing algorithms for field-programmable gate arrays

    … prefabricated logic modules and routing structures provide low manufacturing cost and fast time-to-market implementation solutions to the users. However, the routing delay due to their inherent routing structure has been one of the biggest bottlenecks of their speed performance. …

    texas Repository record for Routing algorithms for field-programmable gate arrays (opens in a new tab)

  6. Distributed routing algorithms for interconnected FDDI LANS

    … one LAN to another across the leased line, a routing algorithm is required. Much research has been done on the Bellman-Ford algorithm and many implementations of it exist in computer networks. However, due to its instability and problems with routing table loops it is an unsatisfactory …

    aston Download PDF for Distributed routing algorithms for interconnected FDDI LANS (opens in a new tab)

  7. Routing algorithms for optimisation of transportation systems

    … to vehicle drivers, hence the need for optimised routing. Another concept gaining popularity is the collaboration in logistics between several companies. Collaboration is thought to be an enabler for a sustainable and efficient SCM. One important improvement of modern logistics is the frequent …

    liverpool-jm Repository record for Routing algorithms for optimisation of transportation systems (opens in a new tab) Download PDF for Routing algorithms for optimisation of transportation systems (opens in a new tab)

  8. Evaluation of routing algorithms and their implementations

    Routing algorithms in interconnection networks can greatly impact system performance. Deterministic routing is simple resulting in small cycle times but does not perform well under congestion. Adaptive routing does perform well under congestion but is more complex resulting in high router cycle …

    colostate Repository record for Evaluation of routing algorithms and their implementations (opens in a new tab)

  9. Routing Algorithms for High-Performance VLSI Packaging

    As the package densities are increasing, escape routing is becoming the main bottleneck in terms of overall routability. For this, we propose novel models and algorithms to solve the escape routing problem in multiple components simultaneously, such that the number of crossings in the intermediate …

    uiuc Repository record for Routing Algorithms for High-Performance VLSI Packaging (opens in a new tab)

  10. Routing Algorithms for Dynamic, Intelligent Transportation Networks

    … of time-dependent shortest path (TDSP) algorithms and k-shortest path (k-SP) algorithms as a practical routing tool in such intelligent transportation networks. Similar algorithms have been used to solve routing problems in computer networks. The similarities and differences between …

    vt Repository record for Routing Algorithms for Dynamic, Intelligent Transportation Networks (opens in a new tab)

  11. Parallelization of Pattern Routing Algorithms in Chip Design

    … dependencies that need to be considered during routing, serial routing algorithms are ruling the industry today. In this thesis, I developed parallel routing algorithms for execution on multicore CPUs and GPUs. I created two routing algorithms such that they can simultaneously route pin pairs …

    texas-state Repository record for Parallelization of Pattern Routing Algorithms in Chip Design (opens in a new tab)

  12. Analytic modelling of agent-based network routing algorithms.

    Interest in adaptive and distributed systems for routing control in networks has led to the development of a new class of algorithms, which is inspired by the shortest path finding behaviours observed in biological ant colonies. This class utilizes ant-like agents, which autonomously traverse the …

    adelaide Repository record for Analytic modelling of agent-based network routing algorithms. (opens in a new tab)

  13. Aging-Aware Routing Algorithms for Network-on-Chips

    … are connected to each other through links. A routing algorithm is implemented inside each router that decides the path that a packet must take to reach the destination processor from the source. If a path is heavily utilized, the links and routers comprising the path start to age, and …

    utahstate Repository record for Aging-Aware Routing Algorithms for Network-on-Chips (opens in a new tab)

  14. ENERGY-EFFICIENT ROUTING ALGORITHMS FOR WIRELESS SENSOR NETWORKS

    … addressing these problems is by implementing a routing protocol that efficiently uses these limited resources and hence reduces errors, improves scalability and increases the network lifetime. The topology of any network is important and wireless sensor networks (WSNs) are no exception. In order …

    liverpool-jm Repository record for ENERGY-EFFICIENT ROUTING ALGORITHMS FOR WIRELESS SENSOR NETWORKS (opens in a new tab) Download PDF for ENERGY-EFFICIENT ROUTING ALGORITHMS FOR WIRELESS SENSOR NETWORKS (opens in a new tab)

  15. Routing algorithms for large scale wireless sensor networks

    Routing in sensor networks is a challenging issue due to inherent constraints such as power, memory, and CPU processing capabilities. In this thesis, we assume an All to All communication mode in an N × N grid sensor network. We explore routing algorithms which load balance the network without …

    tamu Repository record for Routing algorithms for large scale wireless sensor networks (opens in a new tab)

  16. GPS based localized routing algorithms for wireless networks.

    We discuss routing algorithms for wireless networks with the goal of achieving high (or guaranteed) delivery rate and increasing the node life in the network. Some know methods were studied: Most Forward within Radius (MFR) and directional algorithm (DIR). We propose some new location based routing …

    ottawa-retro Repository record for GPS based localized routing algorithms for wireless networks. (opens in a new tab)

  17. Connectivity-Aware Routing Algorithms for Cognitive Radio Networks

    … thesis, we critically investigate the problem of routing in multi-hop CRNs. The main objective of this research is to maximize network connectivity while limiting routing delay. We developed a general connectivity metric for single-band and multi-band CRNs based on the properties of the Laplacian …

    ottawa-retro Repository record for Connectivity-Aware Routing Algorithms for Cognitive Radio Networks (opens in a new tab)

  18. AntNet based routing algorithms for resource constrained networks

    Research in the area of metaheuristics and routing in telecommunication networks have been of great interest in the past several years, especially in wireless networks where routing differs greatly in than in traditional networks. Due to resource constraints, the dynamic nature of networks, and …

    ottawa-retro Repository record for AntNet based routing algorithms for resource constrained networks (opens in a new tab)

Page 1 of 17