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 979 for “"Stabilizing"”.
-
Self-stabilizing running
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.
-
Self-stabilizing wormhole routing
… in familiar topologies to make them self-stabilizing. Self-stabilization is a technique that guarantees tolerance to transient faults (e.g. memory corruption or communication hazard) for a given protocol. Transient faults would typically place the network in an illegitimate state, while …
-
Self-stabilizing tree algorithms
… into an illegal state. If the system were self-stabilizing, however, it is guaranteed that it will return to a legal state after a finite number of state transitions. This thesis presents and proves self-stabilizing algorithms for calculating tree metrics and for achieving mutual exclusion on a …
-
Self-stabilizing routing protocols
… defined as being either legal or illegal. A self-stabilizing system is one that forces a system from an illegal state to a global legal state without external interference, using a finite number of steps. This thesis will concentrate on application of self-stabilization to routing problems, in …
-
Self-stabilizing sorting algorithms
… global state. However, if the system were self-stabilizing, it would be guaranteed that regardless of the current state, the system would recover to a legal configuration in a finite number of moves; The traditional way of creating reliable systems is to make redundant components. …
-
Self-stabilizing network protocols
… into two categories, legal and illegal. A self-stabilizing system will force the system to converge to a legal state regardless of the current state (legal or illegal) in a finite number of steps. So, the system can tolerate some faults automatically without user intervention. This thesis …
-
Self-stabilizing Border Gateway Protocol
… using the paradigm of self-stabilization. A self-stabilizing protocol, starting from an arbitrary state converges, within finite steps, to a state from where the system exhibits the desired behavior. In this thesis, we propose a self-stabilizing Border Gateway Protocol. Our design consists of …
-
Self-stabilizing inter-domain policy routing
… was introduced by Dijkstra in 1974. A self-stabilizing system guarantees that starting from an arbitrary state, the system converges to a legal state in a finite number of steps and remains in a legal state until another fault occurs. Such a system after any unexpected perturbation …
-
Self-stabilizing wormhole routing in hypercubes
… this is the first attempt at designing a self-stabilizing wormhole routing algorithm for hypercubes. Our first algorithm handles all types of faults except for node/link failures. This algorithm achieves optimality in terms of routing path length by following only the preferred dimensions. In …
-
Stabilizing spectral functors of exact categories
This Dissertation was approved for publication on 2017-07-13 at 15:08.
-
Self-stabilizing magnetic bearings for flywheels
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1982.
-
Telecommunication of stabilizing signals in power systems
Deregulation of the power industry has occurred at a rapid pace, opening some promising competition between suppliers. The result of this competition should be to the benefit of customers.;Telecommunication plays a crucial role in integrating systems and ensuring smooth operation by way of …
-
Stabilizing Degenerate Dopants in Colloidal Semiconductor Nanocrystals
… nanocrystal lattice are far more effective at stabilizing free carriers than anions at the nanocrystal surfaces. Chapter 4 applies magnetic circular dichroism (MCD) spectroscopy to identify classical cyclotron splittings in plasmonic semiconductor nanocrystals, and compares their magnetic …
-
Self-stabilizing binary search tree maintenance algorithm
… p are larger than that of p; We present a self-stabilizing [Dij74] algorithm to maintain a binary search tree given a binary tree structure and a sequence of integers as input. This protocol uses neither the processors identifiers nor the size of the tree but assumes the existence of a …
-
Self-stabilizing distributed algorithms for acyclic graphs
A self-stabilizing distributed system is a network of processors, which when started from an arbitrary and possibly illegal state, always returns to a legal state in a finite number of steps. Two self-stabilizing protocols for distributed systems are presented in this thesis. The first protocol …
-
Self-stabilizing deadlock algorithms in distributed systems
A self-stabilizing system is a network of processors, which, when started from an arbitrary (and possibly illegal) initial state, always returns to a legal state in a finite number of steps. Self-stabilization is an evolving paradigm in fault-tolerant computing. This research will be the first time …
-
Time optimal self-stabilizing spanning tree algorithms
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
-
Stabilizing the dual inverted pendulum : a practical approach
A dual inverted pendulum system, consisting of two individual pendulums of different lengths on a single cart, was fully designed and implemented as a demonstration of classical control theory. This document contains an analysis of the complete control system for both a single and dual inverted …
-
Self-stabilizing interval routing algorithm with low stretch factor
… steps starting from any arbitrary state. A self-stabilizing Pivot Interval Routing (PIR) algorithm is proposed in this work. The PIR strategy allows routing along paths whose stretch factor is at most five, and whose average stretch factor is at most three with routing tables of size O(n3/2log …
-
A self-stabilizing interval routing scheme in general networks
… or to the pivots; An algorithm is called self-stabilizing [Dij74] if, starting from an arbitrary initial state, it is guaranteed to reach a correct state in finite time and with no exterior help. In this thesis, we present a self-stabilizing PIR algorithm. The algorithm starts with no knowledge …
Page 1 of 49