Development of Irregular Routing Algorithms for Parallel Computing Environment
In this paper, a review of various regular and irregular parallel computing networks routing algorithm is done. Since irregular networks are usually less costly and multipath in nature as compared to regular Parallel computing networks, hence analysis of irregular and regular Parallel computing networks is important. It can be deduced from the analysis that irregular Parallel computing networks performs better than regular ones. In this paper, a new class of irregular fault-tolerant multistage interconnection network named Fault Tolerant Interconnection (FTI) network is also proposed and analyzed. The FTI network can achieve significant tolerance to faults and good performance with relatively low costs and a simple control scheme.