A new distributed breadth-first-search algorithm
Information Processing Letters
A time-optimal message-efficient distributed algorithm for depth-first-search
Information Processing Letters
Yet another distributed depth-first-search algorithm
Information Processing Letters
Parallel program design: a foundation
Parallel program design: a foundation
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Echo Algorithms: Depth Parallel Operations on General Graphs
IEEE Transactions on Software Engineering
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Abstract: The first sequential distributed algorithm (SDA) presented to assign distinct identities to nodes in distributed systems uses the depth-first search, and requires O in communication and time complexities, where n is the number of nodes in distributed system. We present a parallel distributed algorithm (PDA) to improve the time complexity in synchronous distributed systems. This algorithm works in two phases: in the first phase, we construct a spanning tree (rooted tree) where every node knows one and only one initiator channel and, eventually a set of channels called (children channel). In the second phase, the root starts the assignation, it sends distinct identities over outgoing channels in the rooted tree. This algorithm requires O(m) messages and O(/spl Delta/d) time units where /spl Delta/ is an upper bound time transmission between two linked nodes, and d is the diameter of the network.