Load balancing of parallel tasks in homogeneous as well as heterogeneous systems are major trouble for researches of both industry and academia. Load balancing were broadly classified into two categories namely static load balancing and dynamic load balancing. Nowadays, numerous of researches focus towards dynamic load balancing schemes for multiprocessor system. In this paper, the authors propose a dynamic load balancing strategy for homogeneous multiprocessor system and apply on cube based interconnection network named as Folded Crossed Cube network. The performance of folded crossed cube network gives better result in terms of diameter. Experimental results show that lesser load imbalance factor has been achieved along with execution time. By this algorithm, parallel jobs are solved with largest number of tasks. The merit of this algorithm is that when the number of tasks increases, the execution time decreases with lesser load imbalance factor.

No abstract

The topology of interconnection networks the stage a key role in the performance of all general purpose networking applications. Cube-based architectures are one of the most important interconnection networks that focuses upon the evaluation and applications of cube-based networks. Cubebased architectures have received greatly focus over the past decade since they propose a wealthy interconnected structure with a number of attractive properties such as low diameter, high bisection width, smaller complexity and Cost. However, the major drawback of cube-based architectures is the difficulty of its VLSI layout. In Parallel computer, the hypercube network has been broadly used as the interconnection network. However, the number of communication links for each node is a logarithmic function of the total number of nodes in hypercubes. Therefore, the hypercube is not a superior applicant for an interconnection network for a extremely large parallel computer that might contain hundreds of thousands of nodes due to IC technology and port number restrictions. In this paper a variety of interconnection network based on the cube-based networks is brief discussed along with their properties. X-torus topology has better properties in terms of diameter, average latency, throughput, and path diversity. Although some more links are added in xtorus, the number of links is of the same order of magnitude with that of mesh, xmesh, and torus. It also takes advantage of increasing higher levels of VLSI process. The comparative study suggests the methods to overcome the above restrictions besides having attractive properties.