This Article 
 Bibliographic References 
 Add to: 
How to Improve Safety under Convergence Using Stable Storage
April 2006 (vol. 17 no. 4)
pp. 389-398
Jun Kiniwa, IEEE Computer Society

Abstract—We present a new method for avoiding false privileges with the aid of stable storage. The method is motivated by the commitment in database systems. The commit guarantees that a write operation to stable storage has successfully completed. Since programs are stored in stable storage in self-stabilization, we assume that the stable values are also free from any transient fault. They sometimes give us additional information on whether a state is faulty or not. Using the stable values, we can improve our previous weakly time-adaptive protocol. We analyze the efficiency and the safety of our method and compare it with previously proposed ones. Furthermore, we extend our method by keeping an old version of stable values and show its usefulness.

[1] Y. Afek and S. Dolev, “Local Stabilizer,” J. Parallel and Distributed Computing, vol. 62, no. 5, pp. 745-765, 2002.
[2] J. Beauquier, C. Genolini, and S. Kutten, “Optimal Reactive $k{\hbox{-}}{\rm{Stabilization}}$ : The Case of Mutual Exclusion,” Proc. 18th Ann. ACM Symp. Principles of Distributed Computing, pp. 209-218, 1999.
[3] P.A. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[4] J.E. Burns, M.G. Gouda, and R.E. Miller, “On Relaxing Interleaving Assumptions,” Proc. MCC Workshop Self-Stabilizing Systems, MCC Technical Report No. STP-379-89, 1989.
[5] E.W. Dijkstra, “Self-Stabilizing Systems in Spite of Distributed Control,” Comm. ACM, vol. 17, no. 11, pp. 643-644, 1974.
[6] E.W. Dijkstra, “A Belated Proof of Self-Stabilization,” Distributed Computing, vol. 1, pp. 5-6, 1986.
[7] S. Ghosh and A. Bejan, “A Framework of Safe Stabilization,” Proc. Sixth Int'l Workshop Self-Stabilizing Systems, pp. 129-140, 2003.
[8] S. Ghosh and A. Gupta, “An Exercise in Fault-Containment: Self-Stabilizing Leader Election,” Information Processing Letters, vol. 59, pp. 281-288, 1996.
[9] S. Ghosh, A. Gupta, T. Herman, and S.V. Pemmaraju, “Fault-Containing Self-Stabilizing Algorithms,” Proc. 15th Ann. ACM Symp. Principles of Distributed Computing, pp. 45-54, 1996.
[10] S. Ghosh and X. He, “Fault-Containing Self-Stabilization Using Priority Scheduling,” Information Processing Letters, vol. 73, pp. 145-151, 2000.
[11] T. Herman, “Superstabilizing Mutual Exclusion,” Distributed Computing, vol. 13, no. 1, pp. 1-17, 2000.
[12] T. Herman and S. Pemmaraju, “Error-Detecting Codes and Fault-Containing Self-Stabilization,” Information Processing Letters, vol. 73, pp. 41-46, 2000.
[13] Y. Katayama, E. Ueda, H. Fujiwara, and T. Masuzawa, “A Latency Optimal Superstabilizing Mutual Exclusion Protocol in Unidirectional Rings,” J. Parallel and Distributed Computing, vol. 62, no. 5, pp. 865-884, 2002.
[14] J. Kiniwa, “Avoiding Faulty Privileges in Fast Stabilizing Rings,” IEICE Trans. Fundamentals, vol. E85-A, no. 5, pp. 949-956, 2002.
[15] J. Kiniwa and M. Yamashita, “A Randomized 1-Latent, Time-Adaptive and Safe Self-Stabilizing Mutual Exclusion Protocol,” Parallel Processing Letters, vol. 16, no. 1, Mar. 2006.
[16] S. Kutten and B. Patt-Shamir, “Time-Adaptive Self-Stabilization,” Proc. 16th Ann. ACM Symp. Principles of Distributed Computing, pp. 149-158, 1997.
[17] M. Nesterenko and A. Arora, “Tolerance to Unbounded Byzantine Faults,” Proc. 21st Symp. Reliable Distributed Systems, pp. 22-29, 2002.
[18] J.D. Ullman, Principles of Database and Knowledgebase Systems, Volume I. Computer Science Press, 1988.
[19] I. Yen, “A Highly Safe Self-Stabilizing Mutual Exclusion Algorithm,” Information Processing Letters, vol. 57, pp. 301-305, 1996.

Index Terms:
Mutual exclusion, self-stabilization, false privilege, stable storage, vulnerability under convergence.
Jun Kiniwa, "How to Improve Safety under Convergence Using Stable Storage," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 4, pp. 389-398, April 2006, doi:10.1109/TPDS.2006.47
Usage of this product signifies your acceptance of the Terms of Use.