M.W. Akhtar and M-T. Kechadi (Ireland)
Parallel Computing Systems, Dynamic Load Balancing, P2P Systems, Grid Systems, Graph Embedding.
In this study we evaluate and compare the performance of our load balancing technique on irregular P2P systems em bedded in two regular topologies: 1) Hypercube and 2) TreeP. Hypercube is one of the most studied interconnec tion topologies and exhibits powerful interconnection fea tures , while TreeP is Tree-based P2P network architecture and is based on a tessellation of a 1-D space. The load bal ancing technique employed is a two step strategy. In the first phase, it maps any irregular network topology to a reg ular one. In the second phase the load is balanced among the nodes using PSLB algorithm. In this paper we study and compare the performance of this two-step strategy on hypercube and TreeP topologies. This strategy is proven to be efficient and does not introduce a considerable overhead as shown in the experimental results.
Important Links:
Go Back
