
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M.G. Gouda, "Multiphase Stabilization," IEEE Transactions on Software Engineering, vol. 28, no. 2, pp. 201208, February, 2002.  
BibTex  x  
@article{ 10.1109/32.988499, author = {M.G. Gouda}, title = {Multiphase Stabilization}, journal ={IEEE Transactions on Software Engineering}, volume = {28}, number = {2}, issn = {00985589}, year = {2002}, pages = {201208}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.988499}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Multiphase Stabilization IS  2 SN  00985589 SP201 EP208 EPD  201208 A1  M.G. Gouda, PY  2002 KW  Computing system KW  convergence KW  multiphase recovery KW  periodic reset KW  selfstabilization KW  spanning tree construction. VL  28 JA  IEEE Transactions on Software Engineering ER   
We generalize the concept of stabilization of computing systems. According to this generalization, the actions of a system S are partitioned into n partitions, called phase 1 through phase n. In this case, system S is said to be nstabilizing to a state predicate Q if S has state predicates P.0, ..., P.n such that P.0 = true, P.n = Q, and the following two conditions hold for every j, 1 ≤ j ≤ n. First, if S starts at a state satisfying P.(j1) and if the only actions of S that are allowed to be executed are those of phase j or less, then S will reach a state satisfying P.j. Second, the set of states satisfying P.j is closed under any execution of the actions of phase j or less. By choosing n = 1, this generalization degenerates to the traditional definition of stabilization. We discuss three advantages of this generalization over the traditional definition. First, this generalization captures many stabilization properties of systems that are traditionally considered nonstabilizing. Second, verifying stabilization when n > 1 is usually easier than when n = 1. Third, this generalization suggests a new method of fault recovery, called multiphase recovery.
[1] A. Arora and M.G. Gouda, “Closure and Convergence: A Foundation of FaultTolerant Computing,” IEEE Trans. Software Eng., vol. 19, no. 11, pp. 1,015–1,027, 1993.
[2] A. Arora, M.G. Gouda, and G. Varghese, "Constraint Satisfaction as a Basis for Designing Nonmasking FaultTolerance," J. High Speed Networks, vol. 5, no. 3, pp. 293306, 1996.
[3] Y. Afek and A. Bremler, “SelfStabilizing Unidirectional Network Algorithms by Power Supply,” Chicago J. Theoretical Computer Science, vol. 4, no. 3, pp. 148, 1998.
[4] A. Bui, A.K. Datta, F. Petit, and V. Villain, “StateOptimal SnapStabilizing PIF in Tree Networks,” Proc. Third Workshop SelfStabilizing Systems, pp. 7885, 1999.
[5] N.S. Chen, F.P. Yu, and S.T. Huang, “A SelfStabilizing Algorithm for Constructing Spanning Trees,” Information Processing Letters, vol. 39, pp. 147151, 1991.
[6] S. Dolev and T. Herman, “Super Stabilizing Protocols for Dynamic Distributed Systems,” Proc. Second Workshop SelfStabilizing Systems, published as a technical report, Dept. of Computer Science, Univ. of Nevada, Las Vegas, pp. 3.13.15, 1995.
[7] S. Ghosh, A. Gupta, T. Herman, and S.V. Pemmaraju, “FaultContaining SelfStabilizing Algorithms,” Proc. 15th Ann. ACM Symp. Principles of Distributed Computing (PODC '96), pp. 45–54, 1996.
[8] M.G. Gouda, “The Triumph and Tribulation of System Stabilization,” Invited Paper, Proc. Int'l Workshop Distributed Algorithms, J.M. Helary and M. Raynal eds., pp. 118, 1995.
[9] M.G. Gouda and T. Herman, “Adaptive Programming,” IEEE Trans. Software Eng., vol. 17, no. 9, pp. 911921, Sept. 1991.
[10] M.G. Gouda and N. Multari, “Stabilizing Communication Protocols,” IEEE Trans. Computers, vol. 40, no. 4, pp. 448458, Apr. 1991.
[11] F.F. Haddix, “Alternating Parallelism and the Stabilization of Cellular Systems,” PhD dissertation, Dept. of Computer Sciences, Univ. of Texas at Austin, 1999.
[12] S. Katz and K.J. Perry, “SelfStabilizing Extensions for Message Passing Systems,” Distributed Computing, vol. 7, pp. 1726, 1993.
[13] S. Kutten and B. PattShamir, “Stabilizing TimeAdaptive Protocols,” Theoretical Computer Science, vol. 220, pp. 93111, Year?