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

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

作　　者：苏小虎[1] 方木云[1] 邰伟鹏[1] 郑啸[1] 

机构地区：[1]安徽工业大学计算机科学系,安徽马鞍山243002

出　　处：《小型微型计算机系统》2012年第9期2053-2055,共3页Journal of Chinese Computer Systems

基　　金：国家青年自然科学基金项目(61003311)资助;安徽省高校自然科学基金项目(KJ2010A051)资助

摘　　要：利用仿真来研究双环网络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.

关 键 词：双环网络 仿真 紧优 L形瓦 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]