T. Herman, "Observations on time adaptive self-stabilization", Technical Report TR 97-07, University of Iowa, 1997.  Home/Search   Document Details and Download   Summary   Related Articles

....In any state when more than one process can make a move, the daemon chooses one of them in a random way. Systems with continuous states To end with, we mention an interesting attempt to find an appropriate computational model for self stabilizing systems with continuous states, presented in [37]. That paper poses numerous questions provoking future work over some new fields such as: the construction of continuous computation models, the significance of different stabilization types and the influence of the continuous nature of processes upon behavior of known algorithms. 4. ....

....on the number f of faults. These ideas use replication and voting strategy to repair corrupted states. However, this approach has some limitations, e.g. there must be f 2 n , where n is the total number of processors, and the system may not recover if a fault occurs during reparation. Herman [37] overcomes these limitations by proposing a composite protocol combining the time adaptive algorithm of [46] with a non time adaptive selfstabilizing backup algorithm for situations in which the first one may not converge. His solution deals with any number of faults. Also the local stabilizer ....

T. Herman, "Observations on time adaptive self-stabilization", Technical Report TR 97-07, University of Iowa, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC