Network Performance of Pruned Hierarchical Torus Network

摘要: The complexity of an interconnection network often determines the size parallel computer and thus attainable performance a is limited by characteristics network. Pruning technique reduces hence increases performance. In this paper, we apply pruning on Hierarchical Torus Network (HTN) study architectural details pruned HTN. We have explored diameter, average distance, bisection width, peak number vertical links, VLSI layout area different It shown that HTN possesses several attractive features including small wires, particularly economic as compared to its non-pruned counterpart.