New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
IEEE Transactions on Computers
An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
New models and algorithms for future networks
IEEE Transactions on Information Theory
Publish/subscribe scheme for mobile networks
Proceedings of the second ACM international workshop on Principles of mobile computing
Asynchronous resource discovery
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Asynchronous resource discovery
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
On the Performance of Flooding-Based Resource Discovery
IEEE Transactions on Parallel and Distributed Systems
Confidence-based grid service discovery
International Journal of Web and Grid Services
Journal of Parallel and Distributed Computing
O(log n)-time overlay network construction from graphs with out-degree 1
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: self-stabilizing resource discovery algorithm
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
The resource discovery problem was introduced by Harchol-Balter, Leigh ton and Lewin. They developed a number of algorithms for the problem in the weakly connected directed graph model. This model is a directed logical graph, that represents the vertices' “knowledge” about the topology of the underlying communication network.The current paper proposes a deterministic algorithm for the problem in the same model, with improved time, message, and communication complexities. Each previous algorithm had a complexity that was higher at least in one of the measures. Specifically, previous deterministic solutions required either time linear in the diameter of the initial network, or communication complexity &Ogr;(n3) (with message complexity &Ogr;(n2)), or message complexity &Ogr;(¦E0¦ log n) (where E0 is the edge set of the initial graph). Compared to the main randomized algorithm of Harchol-Balter, Leigh ton, and Lewin, the time complexity is reduced from &Ogr;(log2 n) to &Ogr;(log n), the message complexity from &Ogr;(n log2 n) to &Ogr;(n log n), and the communication complexity from &Ogr;(n2 log3 n) to &Ogr;(¦E0¦ log2 n). Our work significantly extends the connectivity algorithm of Shiloach and Vishkin which was originally given for a parallel model of computation. Our result also confirms a conjecture of Harchol-Balter, Leighton, and Lewin, and addresses an open question due to R. Lipton.