An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
Distributed software engineering
ICSE '94 Proceedings of the 16th international conference on Software engineering
The demarcation protocol: a technique for maintaining constraints in distributed database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient Numerical Error Bounding for Replicated Network Services
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Effective page refresh policies for Web crawlers
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
Given an n-nodes network and an assertion G expressing its correctness, it is shown that G can be decomposed into collection of n local assertions and n.(n-1) “communication” assertions. The special case of a 2-nodes network is first examined, and it is shown how the notion of Galois connections in lattice theory is a basic tool for the assertion decomposition. The principles of a communication protocol that allow to maintain the resulting assertions are described. For the n-nodes network it is shown that assertion G induces Galois connections between any two parts of the network. General formulae for the local and communication assertions are found using this fact. It is also shown that the communication assertions do involve only a pair of nodes each one, which makes possible the use of techniques taken from the 2-nodes network for their maintenance. As an application example a distributed algorithm to solve the “2-out-of-3” problem is proposed.