双环网络G(N;1,s)的L形瓦仿真算法改进

Improved Algorithm to Simulate L-shaped Tile of Double-loop NetworksG(N;1,s)

利用仿真来研究双环网络L形瓦,在国内外文献中尚不多见,文献[1]提出了一种仿真算法,文献[2]使用数组对文献[1]的算法作了改进.其不足之处是使用了过多过长的中间数组,影响了仿真速度.针对这一不足,根据L形瓦的h边特性,使用了更少更短的数组改进了文献[2]的算法,实验结果表明,改进的算法极大地提高了仿真速度.此外还给出了L形瓦的h边分布特点,并作了进一步分析.

There are few reports which using simulation to research doubl e-loop networks. Reference [ 1 ] presented a simulation algo- rithm, 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 cal- culation more. Furthermore, the distributing figure of L-shaped tile＇s h-edge is put forward, and analysis its character.