Probabilistic analysis of a network resource allocation algorithm
Information and Control
Parallel symmetry-breaking in sparse graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Detecting global termination conditions in the face of uncertainty
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Applying static network protocols to dynamic networks
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Applying static network protocols to dynamic networks
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
We introduce a new primitive, the Resource Controller, which abstracts the problem of controlling the total amount of resources consumed by a distributed algorithm. We present an efficient distributed algorithm to implement this abstraction. The message complexity of our algorithm per participating node is polylogarithmic in the size of the network, compared to the linear cost per node of the naive algorithm. The implementation of our algorithm is simple and practical and the techniques used are interesting because a global quantity is managed in a distributed way. The Resource Controller can be used to construct efficient algorithms for a number of important problems, such as the problem of bounding the worst-case message complexity of a protocol and the problem of dynamically assigning unique names to nodes participating in a protocol.