A belated proof of self-stabilization
Distributed Computing
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
A highly safe self-stabilizing mutual exclusion algorithm
Information Processing Letters
An exercise in fault-containment: self-stabilizing leader election
Information Processing Letters
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time-adaptive self stabilization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Optimal reactive k-stabilization: the case of mutual exclusion
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Error-detecting codes and fault-containing self-stabilization
Information Processing Letters
Fault-containing self-stabilization using priority scheduling
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A latency optimal superstabilizing mutual exclusion protocol in unidirectional rings
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Superstabilizing mutual exclusion
Distributed Computing
A framework of safe stabilization
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Analysis of an Intentional Fault Which Is Undetectable by Local Checks under an Unfair Scheduler
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
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.