Author :
Gouda, Mohamed G. ; Haddix, Furman
Author_Institution :
Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
Abstract :
An alternator is an array of interacting processes that satisfy three conditions. First, if a process has an enabled action at some state, then no neighbor of that process has an enabled action at the same state. Second, along any concurrent execution, each action is executed infinitely often. Third, along any maximally concurrent execution, the alternator is stabilizing to states where the number of enabled actions is maximal. We specify an alternator with arbitrary topology. We also show that this alternator can be used in transforming any system that is stabilizing assuming serial execution, to one that is stabilizing assuming concurrent execution
Keywords :
concurrency theory; distributed processing; self-adjusting systems; stability; alternator; arbitrary topology; concurrent execution; enabled action; interacting processes; maximally concurrent execution; serial execution; Alternators; Database systems; Topology;
Conference_Titel :
Self-Stabilizing Systems, 1999. Proceedings. 19th IEEE International Conference on Distributed Computing Systems Workshop on
Conference_Location :
Austin, TX
Print_ISBN :
0-7695-0228-8
DOI :
10.1109/SLFSTB.1999.777486
