Efficient load balancing on biswapped networks

This paper focuses on devising an efficient algorithm for load balancing on the promising biswapped interconnection networks which were recently proposed as a better architecture over the well-known OTIS networks. The proposed algorithm is called GPM which reduces the number of load balancing steps of the existed algorithms obviously. GPM algorithm first schedules load flows on inter-groups links to achieve the balanced status among groups. Then a general load balancing strategy is executed in each of all groups to balance processor loads. The analytical model proves that GPM algorithm is efficient and results of computer simulation experiment indicate that GPM can implement load balancing in biswapped network interconnected environments efficiently, in terms of various parameters.