Time-efficient self-stabilizing algorithms through hierarchical structures
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
| Hi-index | 0.00 |
Grid-based replication protocols are widely accepted for being a superior basis for implementing highly available operations on replicated shared objects with extremely low quorum sizes. Beside these advantages, grid protocols are truly distributed, i.e. all of the shared object's replicas are included in exactly the same number of quorum sets and no quorum set is favored by the replication control protocol. In this paper, we pledge for the abandonment of true distribution in order to obtain replication control protocols with increased efficiency of access operations on replicated shared objects. We support our thesis by presenting a new priority-based protocol called Second Chance Protocol. It is based on a multi-level voting protocol and can be customized such that it performs operations on replicated shared objects at exactly the same costs as grid-based schemes. With respect to operation availabilities, it outperforms grid-based schemes.