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

Improved algorithm to simulate L-shaped tile of double-loop networks G(N;1,s)

作　　者：邰伟鹏[1] 方木云[1] 

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

出　　处：《计算机工程与设计》2007年第16期4007-4008,4034,共3页Computer Engineering and Design

基　　金：国家自然科学基金项目(60473142)

摘　　要：利用仿真来研究双环网络L形瓦的方法在国内外文献中尚不多见,文献[1]中提出了一种仿真算法,并成功实现L形瓦的仿真,其不足之处是利用数据库存取中间结果,严重影响了仿真速度,当N值很大时需要计算的时间过长。针对这一不足,提出了利用数组取代数据库来存取中间结果,实验结果表明,改进的算法极大地提高了计算速度。此外还给出两例大值N直径分布图,并对直径分布特点作了进一步的分析。There are few reports which using simulation to research double-loop networks. Reference [ 1 ] presented an algorithm, and realized the simulation of L-shaped tile. But the disadvantage of this algorithm is using database technology to keep middle results, Where N becomes very large, it spends too much time to calculate, Therefore, an improved algorithm is presented that used array to replace the database for keeping middle results. The result of experiments indicated that the improved algorithm improved the speed of calculation. Furthermore, distributing figure of large N＇s diameter is put forward, and analysis the character of diameter distributing is analysed further.

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

分 类 号：TP302[自动化与计算机技术—计算机系统结构] O157.9[自动化与计算机技术—计算机科学与技术]