| Summary: | 博士 === 國立清華大學 === 資訊科學學系 === 83 === In this dissertation, we study the problem of designing self-
stabilizing algorithms. A self-stabilizing algorithm has the
property that regardless of the initial state of the system and
the execution sequence of the processors, the system will reach
a legitimate state within a finite number of moves. Most
previous self-stabilizing algorithms deal with distri- buted
control problems such as token passing, and problems on
unweighted graphs such as spanning tree construction. We have
put our efforts on weighted graphs. The following problems are
studied: finding the shortest paths from a source node to the
other nodes, constructing the minimal spanning tree of an
undirected graph, identifying the bridges of a connected graph,
and finding a consistent orientation of the processors of a
uniform unoriented ring. We use different approaches to design
algorithms for these problems, and proposed a concept which may
simplify the task of converting a non self-stabilizing
algorithm into a self-stabilizing one. We show that all these
algorithms can work well without a central demon. We also
develop a new approach to make the correctness reasoning under
the distributed model easier.
|
|---|
