George Varghese. Local checking and correction in a shared memory model. In preparation, 1992.  Home/Search   Document Not in Database   Summary   Related Articles

....we believe our protocol is simpler and more transparent. While the mutual exclusion protocol is very simple, its simplicity makes it a good candidate to understand how the general method of local correction can be applied. A more complicated example (network reset protocol) can be found in [Var92a]. Stabilizing spanning tree protocols have been well studied [AKY90] AG90] AV91] Thus we can reduce the problem of token passing on an arbitrary connected network to that of token passing on a tree. Instead of modelling the interface to the network automaton that computes the tree, we will ....

....and without local correction) can be used to explain a number of self stabilizing protocols and can be used to design new protocols. While these techniques cannot be used to solve every problem, there are a large number of useful protocols that can be efficiently stabilized using these notions. In [Var92a] we provide an example of a network reset protocol that somewhat surprisingly is locally correctable using the trivial partial order. In other places we have used local checking to provide solutions for mutual exclusion, the end to end problem, stabilizing synchronizers, and spanning tree ....

George Varghese. Local checking and correction in a shared memory model. In preparation, 1992.

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