Researches On Fault-Tolerant Models And Routing Algorithms Of High Performance Parallel Computers Interconnection Networks

Hypercube and Petersen Graph networks have been paid great attention by researchers, and are one of the most important and attractive interconnection networks hitherto, for their excellent characteristics such as regularity, symmetry, good fault-tolerance, parallelism, Extensibility, and Embeddable ability. Since Petersen Graph and Hypercube networks are of lots of similarities in their topologies, but are not the same, and in addition, novel interconnection networks with some special natures can be constructed through the combination of their special good charateristics, then the topologies and routing algorithms of Petersen Graph and Hypercube networks are researched synthetically and comparatively in this paper.On the researches of topologies and routing algorithms of Hypercube interconnection networks, an overview of the current major works on this field are presented in this paper at first, and then, on the basis of these current researching outcomes, three kinds of new fault-tolerant models of Hypercube interconnection networks, such as Maximal Safety Path Vector based fault-tolerant model (MSPV), Maximal Safety Path Matrix based fault-tolerant model (MSPM), and two kinds of sub cube-connection based fault-tolerant models, are proposed. And it is proved that those above new fault-tolerant models are of better fault-tolerant performances than the previous fault-tolerant models such as Safety Vector based fault-tolerant model (SV), Extended Safety Vector based fault-tolerant model (ESV), Optimal Path Matrix based fault-tolerant model (OPM), Extended Optimal Path Matrix based fault-tolerant model (EOPM), and two kinds of local connection based fault-tolerant models repectively, and are their final extensions furthermore. Finally, efficient fault-tolerant routing algorithms based on those above new fault-tolerant models are designed, and it is proved that the fault-tolerant ability of those innovative fault-tolerant routing algorithms are better than that of those previous fault-tolerant routing algorithms based on SV, ESV, OPM, and EOPM separately.On the researches of topologies and routing algorithms of Petersen Graph interconnection networks, an overview of the current major works on this field are presented in this paper at first, and then, on the basis of these current researching outcomes, two kinds of new Petersen Graph interconnection networks such as double-loops connected Petersen network DLCP(k) and hierarchical double-loops...