
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M. Flatebo, A.K. Datta, "TwoState SelfStabilizing Algorithms for Token Rings," IEEE Transactions on Software Engineering, vol. 20, no. 6, pp. 500504, June, 1994.  
BibTex  x  
@article{ 10.1109/32.295897, author = {M. Flatebo and A.K. Datta}, title = {TwoState SelfStabilizing Algorithms for Token Rings}, journal ={IEEE Transactions on Software Engineering}, volume = {20}, number = {6}, issn = {00985589}, year = {1994}, pages = {500504}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.295897}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  TwoState SelfStabilizing Algorithms for Token Rings IS  6 SN  00985589 SP500 EP504 EPD  500504 A1  M. Flatebo, A1  A.K. Datta, PY  1994 KW  distributed algorithms; token networks; local area networks; probability; fault tolerant computing; reliability; twostate selfstabilizing algorithms; token rings; legal state; illegal state; infrequent errors; mutual exclusion algorithms; randomized central demon; network connections; probabilistic algorithm; asynchronous unidirectional ring; binary state machines; distributed algorithms; distributed system VL  20 JA  IEEE Transactions on Software Engineering ER   
A selfstabilizing 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. This implies that the system can automatically deal with infrequent errors. One issue in designing selfstabilizing algorithms is the number of states required by each machine. This paper presents mutual exclusion algorithms which will be selfstabilizing while only requiring each machine in the network to have two states. The concept of a randomized central demon is also introduced in this paper. The first algorithm is a starting point where no randomization is needed (the randomized central demon is not necessary). The other two algorithms require randomization. The second algorithm builds on the first algorithm and reduces the number of network connections required. Finally, the number of necessary connections is again reduced yielding the final twostate, probabilistic algorithm for an asynchronous, unidirectional ring of processes.
[1] G. Brown, M. Gouda, and M. Wu, "Token systems that self stabilize,"IEEE Trans. Comput., vol. 38, no. 6, pp. 845852, June 1989.
[2] J. Burns, M. Gouda and R. Miller, "On relaxing interleaving assumptions,"Proc. MCC Workshop SelfStabilization, Austin, TX, Nov. 1989.
[3] J. Burns and J. Pachl, "Uniform selfstabilizing rings,"ACM Trans. Programming Languages Syst., vol. 11, no. 2, pp. 330344, 1989.
[4] E. J. H. Chang, G.H. Gannet, and D. Rotem, "On the costs of selfstabilization,"Inform. Process. Lett., vol. 24, pp. 311316, 1987.
[5] E. Dijkstra, "Selfstabilizing systems in spite of distributed control,"Commun. ACM, vol. 17, pp. 643644, 1974.
[6] E. W. Dijkstra, "Selfstabilization in spite of distributed control," inSelected Writings On Computing: A Personal Perspective. SpringerVerlag, Berlin: 1982, pp. 4146.
[7] S. Dolev, A. Israeli, and S. Moran, "Selfstabilization of dynamic systems assuming only read/write atomicity," inProc. Ninth ACM Symp. Principles of Distrib. Computing, 1990, pp. 103117.
[8] M. Flatebo and A. Datta, "Twostate selfstabilizing algorithms," inIEEE Sixth Int. Parallel Proc. Symp., Beverly Hills, CA, Mar. 1992, pp. 198203.
[9] M. Flatebo, A. K. Datta, and S. Ghosh, "Selfstabilization in distributed systems," inReadings in Distr. Comp. Syst.T. L. Casavant and M. Singhal Eds. New York: IEEE Computer Society Press, 1994, pp. 100114.
[10] S. Ghosh, "Binary selfstabilization in distributed systems,"Inform. Proc. Lett., vol. 40, pp. 153159, 1991.
[11] Y. Saitoh and H. Imai, "Multiple unidirectional byte errorcorrecting codes,"IEEE Trans. Inform. Theory, vol. 37, pp. 903908, May 1991.
[12] T. Herman, "Selfstabilization: Randomness to reduce space,"Distributed Computing, vol. 6, pp. 9598, 1992.
[13] A. Israeli and M. Jalfon, "Token management schemes and random walks yield selfstabilizing mutual exclusion," inProc. 9th Ann. ACM Symp. Principles of Distr. Comput., Quebec City, PQ, Canada, Aug. 1990, pp. 119131.
[14] M. Schneider, "SelfStabilization,"ACM Comput. Surveys, vol. 25, no. 1, pp. 4567, 1993.
[15] M. Tchuente, "Sur l'autostabilisation dans un reseau d'ordinateurs,RAIRO Informatique Theorique, vol. 15, no. 1, pp. 4766, 1981.
[16] P. Tetali and P. Winkler, "On a random walk problem arising in selfstabilizing token management," inProc. 10th Ann. ACM Symp. Principles of Distr. Comput., Montreal, PQ, Canada, Aug. 1991, pp. 273280.