PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Broadcast with partial knowledge (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Mu3D: a causal consistency protocol for a collaborative VRML editor
VRML '00 Proceedings of the fifth symposium on Virtual reality modeling language (Web3D-VRML)
A real-time synchronization mechanism for collaborative model management
Decision Support Systems
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
A simple distributed algorithm for the maintenance of a spanning tree
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
| Hi-index | 0.01 |
A basic task in distributed computation is the maintenance at each processor of the network, of a current and accurate copy of a common database. A primary example is the maintenance, for routing and other purposes, of a record of the current topology of the system.Such a database must be updated in the wake of locally generated changes to its contents. Due to previous disconnections of parts of the network, a maintenance protocol may need to update processors holding widely varying versions of the database.We provide a deterministic protocol for this problem, with only polylogarithmic overhead in both time and communication complexities. Previous deterministic solutions required polynomial overhead in at least one of these measures.