本文選題：最短路由算法 + 容錯路由算法��； 參考：《計算機(jī)科學(xué)》2017年S1期

【摘要】：Mesh網(wǎng)絡(luò)是較早研究的且現(xiàn)在仍然是最為重要的、最有吸引力的網(wǎng)絡(luò)模型之一。因其結(jié)構(gòu)、規(guī)則簡單及良好的可擴(kuò)展性,易于VLSI(超大規(guī)模集成電路)的實現(xiàn),網(wǎng)格(Mesh)網(wǎng)絡(luò)不僅成為了許多理論研究的基礎(chǔ)模型,而且也是許多大型多處理器并行計算機(jī)系統(tǒng)所采用的拓?fù)浣Y(jié)構(gòu)。給出了兩種故障情形下的最短路由算法:1)當(dāng)Mesh的行數(shù)大于等于3且列數(shù)大于等于3、出現(xiàn)一個矩形故障區(qū)域時,給出了任意兩個無故障結(jié)點間的最短路由算法,并且計算出了路徑長度;2)當(dāng)Mesh的行數(shù)≥3且列數(shù)≥3、某個結(jié)點及其k跳以內(nèi)的鄰居結(jié)點出現(xiàn)故障時,給出了任意兩個無故障結(jié)點間的最短路由算法,并且計算出了路徑長度。
[Abstract]:Mesh network is one of the most important and attractive network models. Due to its simple structure, simple rules and good scalability, it is easy to implement VLSI (VLSI). Mesh network is not only the basic model of many theoretical studies. It is also a topology used in many large multiprocessor parallel computer systems. In this paper, the shortest routing algorithm for two kinds of fault cases: 1) when the number of rows of mesh is greater than or equal to 3 and the number of columns is greater than or equal to 3, the shortest routing algorithm between any two faultless nodes is given when there is a rectangular fault area. The shortest routing algorithm between any two faultless nodes is given and the path length is calculated when the number of rows of mesh is 鈮，

本文編號：2080346