Hits:

Indexed by:会议论文

Date of Publication:2008-08-20

Included Journals:EI、CPCI-S、Scopus

Page Number:338-+

Key Words:load balancing; crossed cube; dimension exchange; multiprocessors

Abstract:The crossed cube CQ(n) is a variant of the hypercube Q(n). Due to its better properties than Q(n), it has attracted a lot of concentrations. The load balancing and fault-tolerance are very important factors which affect the whole performance of parallel systems. In this paper, we propose a Dimension-Exchange-Based algorithm for crossed cubes to solve the problem of load balancing. The proposed algorithm is based on the links using related-pairs among the nodes. So, it is more general and is still available for Q(n) but the one for Q(n) can not be used on CQ(n) directly. This algorithm studies two cases of crossed cubes, i.e., healthy crossed cubes and injured crossed cubes with no more than n-1 faulty links. We also analyze some properties of crossed cubes. The simulation results show that our algorithm achieves better performance of parallel systems.