Load balancing, selection sorting on the hypercube
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Embedding an Arbitrary Binary Tree into the Star Graph
IEEE Transactions on Computers
Two Ranking Schemes for Efficient Computation on the Star Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Balanced Spanning Trees in Complete and Incomplete Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees
IEEE Transactions on Computers
Strategies for Dynamic Load Balancing on Highly Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
An Efficient Algorithm for Perfect Load Balancing on Hypercube Multiprocessors
The Journal of Supercomputing
Node-ranking schemes for the star networks
Journal of Parallel and Distributed Computing
Dynamic load balancing by diffusion in heterogeneous systems
Journal of Parallel and Distributed Computing
Optimal broadcasting on incomplete star graph interconnection networks
Journal of Systems Architecture: the EUROMICRO Journal
Leader election in hierarchical star network
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
A new analytical method for parallel, diffusion-type load balancing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Dynamic diffusion load balancing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The triangular pyramid: Routing and topological properties
Information Sciences: an International Journal
Properties of a hierarchical network based on the star graph
Information Sciences: an International Journal
| Hi-index | 0.00 |
In this paper, we use the regular distribution method to design a perfect load balancing algorithm for an n-star with a maximum error of 1 and a time complexity of 3n(n+1). This algorithm is based on the novel notion of leader trees. A second algorithm proposed in this paper as an enhancement to our first algorithm and uses an arbitrary spanning tree as the leader tree and has a worst time complexity of 2.25n 2驴3n+0.75. We also discuss the issue of dynamically selecting the leader tree and hybrid load balancing algorithms in general. Furthermore, we present a hybrid algorithm for load balancing on the star interconnection network which benefits from a diffusion load balancing preprocessing phase and shows a smaller mean time complexity than our two first algorithms.