Election in a complete network with a sense of direction
Information Processing Letters
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
New lower bound techniques for distributed leader finding and other problems on rings of processors
Theoretical Computer Science
Decomposing a star graph into disjoint cycles
Information Processing Letters
On the fault-diameter of the star graph
Information Processing Letters
On some properties and algorithms for the star and pancake interconnection networks
Journal of Parallel and Distributed Computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules
IEEE Transactions on Parallel and Distributed Systems
Perfect load balancing on the star interconnection network
The Journal of Supercomputing
Leader election algorithm using heap structure
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
| Hi-index | 0.03 |
We propose a new leader election algorithm for the oriented hierarchical star networks that has linear message complexity.