Improved Algorithm to Simulate L-shaped Tile of Double-loop NetworksG(N;1,s)
Xiao Zheng · Journal of Chinese Computer Systems · 2012
There are few reports which using simulation to research doub1e-loop networks.Reference[1] presented a simulation algorithm,and reference[2] presented an improved algorithm with array,But the disadvantage of this algorithm is using too much and too long middle array,so it spends too much time to calculate.Therefore,an improved algorithm with too little and too short array by the characteristic of L-shape tile′s h-edge,The result of experiments indicated that the improved algorithm improved the speed of calculation more.Furthermore,the distributing figure of L-shaped tile′s h-edge is put forward,and analysis its character.