跳到主要內容

臺灣博碩士論文加值系統

(44.222.64.76) 您好!臺灣時間:2024/06/14 04:40
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:陳瑞堂
研究生(外文):Juei-Tang Chen
論文名稱:二維網狀結構中傳輸均衡之研究
論文名稱(外文):On Balancing the Traffic in Two-Dimensional Meshes
指導教授:莊博任
指導教授(外文):Po-Jen Chuang
學位類別:碩士
校院名稱:淡江大學
系所名稱:電機工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:1999
畢業學年度:87
語文別:中文
論文頁數:75
中文關鍵詞:二維網狀結構適應的通道使用率管制區均衡的性能
外文關鍵詞:Two-dimensional meshesAdaptiveChannel utilizationRestricted areaBalancedPerformance
相關次數:
  • 被引用被引用:0
  • 點閱點閱:171
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在已提出之文獻中,應用於二維網狀連接結構之繞徑演算法,目標都著重於設計一個更具適應性的繞徑演算法,以增加更多可供選擇之傳輸通道來提升通道之使用率,虛擬通道技術開始被使用後,使得適應性繞徑演算法能夠更靈活的運用,但是卻忽略了均衡的使用所有通道對系統效能所可能造成的影響。為了能夠使系統在分配使用通道時能更具均勻,我們提出管制區的觀念。管制區的觀念是針對通道使用率失衡,導致網路資源無法充分利用所提出之改善方法。我們根據轉向模式和適應區域的觀念來分析每個繞徑演算法封包傳送時的行為模式(前進的方向或區域),進一步找出壅塞的區域,此壅塞的區域即是我們設置管制區的範圍。我們所提出的方法,首先決定管制區的範圍,並對原先已知的繞徑演算法做適度的修改,並將封包加上額外的標籤,以註記封包是否通過管制區,並使用我們所提出之繞徑分類法,來疏導封包之繞徑行為,在本文中我們將舉例說明理想的封包繞徑模式,來說明封包的繞徑管制方式。在管制區的範圍內,我們將有效的管制所有封包之傳輸繞徑活動,減少該區繞徑頻繁,傳輸延遲的壅塞情況,並進而將交通疏導至其餘邊緣閒置區域。以管制負載及分散負載雙管齊下的方式來解決通道使用不均的問題,達到充分使用資源的目的,更可據以提升系統效能。

Previous research on routing algorithms for two-dimensional meshes includes using adaptive routing approaches. An adaptive routing algorithm provides more feasible paths between source and destination nodes. But when traffic is heavy, uneven network traffic often results. That is, traffic tends to concentrate in a certain area of the network, prompts early saturation of that area and hence degrades network performance. To balance channel utilization in a network in order to avoid congestion, we propose the concept of "restricted area". The restricted area is defined to be the area where channel utilization in the network concentrates. The main goal of this research is to locate, in the first place, an appropriate restricted area for the network, and then set certain guidelines to restrict and direct transmission in that area. With the location and function of the restricted area, channel utilization becomes more balanced. As a result, transmission can be distributed more evenly, ensuring reduced transmission latency and better performance for the network.

第一章 緒論 1
第二章 相關研究背景 4
2.1 二維網狀連接結構 4
2.2 蟲孔式繞徑 6
2.3 適應的繞徑 7
2.4 虛擬通道 8
2.5 轉向模式 9
2.6 通道選擇策略 11
第三章 適應區域及繞徑演算法 14
3.1 適應區域的觀念 14
3.2 未使用虛擬通道之繞徑演算法及其適應區域 14
3.2.1 West-First繞徑演算法 15
3.2.2 North-Last繞徑演算法 17
3.2.3 Negative-First繞徑演算法 18
3.3 使用虛擬通道之繞徑演算法及其適應區域 19
3.3.1 3p繞徑演算法 19
3.3.2 Mesh_route繞徑演算法 21
3.3.3 PFNF繞徑演算法 21
第四章 管制區觀念 24
4.1 管制區的觀念 24
4.2 加上管制區後的繞徑演算法 25
4.3 管制區使用分類 27
4.4 管制區的定位問題探討 32
第五章 模擬分析與效能評估 35
5.1 模擬模型及評估參數 35
5.2 模擬結果及分析 38
5.2.1 沒有使用虛擬通道之繞徑演算法模擬 38
5.2.2 使用虛擬通道之繞徑演算法模擬 53
第六章 結論 71
參考文獻 73

[1] J. Duato, "A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks," IEEE Trans. on Parallel and Distributed Systems, Vol. 6, No. 10, pp. 1055-1067, Oct. 1995.
[2] C. J. Glass and L.M. Ni, "The Turn Model for Adaptive Routing," J. ACM, Vol.41, No. 5, pp. 874-902, Sept. 1994.
[3] J. H. Upadhyay, V. Varavithya, and P. Mohapatra, "A Traffic-Balanced Adaptive Wormhole Routing Scheme for Two-Dimensional Meshes," IEEE Trans. on Computers, Vol. 46, No. 2, pp. 190-197, Feb. 1997.
[4] W. J. Dally, "Virtual Channel Flow Control," IEEE Trans. on Parallel and Distributed Systems, Vol. 3, No. 2, pp. 194-205, Mar. 1992.
[5] L. Schwiebert and D.N. Jayasimha, "Optimally Fully Adaptive Minimal Wormhole Routing for Meshes," J. Parallel and Distributed Computing, Vol. 27, pp. 56-70, 1995.
[6] C.J. Glass and L.M. Ni, "Adaptive Routing in Mesh-Connected Networks," Proc. 1992 Int'l Conf. Distributed Computer Systems, pp. 12-19, 1992.
[7] L. M. Ni and P. K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," IEEE Computer, Vol. 26, No. 2, pp. 62-76, Feb. 1993.
[8] W.J. Dally and H. Akoi, "Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels," IEEE trans. on Parallel and Distributed systems, Vol. 4, No. 4, pp. 466-475, Apr. 1993.
[9] C. C. Su and K. G. Shin, "Adaptive Deadlock-Free Routing in Multicomputers Using Only One Extra Virtual Channel," Proc. 22nd Int'l. Conf. on Parallel Processing, Aug. 1993, pp. 227-231.
[10] W. J. Dally, "Performance Analysis of k-ary n-cube Interconnection Networks," IEEE Trans. on Computers, vol. 39, no. 6, pp. 775-785, June 1990.
[11] Y.M. Boura and C.R. Das, "Efficient Fully Adaptive Wormhole Routing in n-Dimensional Meshes," Proc. 14th Int'l. Conf. on Distributed Computing Systems, 1994, pp. 589-596.
[12] R. V. boppana and S. Chalasani, "A Comparison of Adaptive Wormhole Routing Algorithms," Proc. 20th Int'l Symp. on Computer Architecture, May 1993, pp. 351-360.
[13] J. H. Upadhyay, V. Varavithya, and P. Mohapatra, "Efficient and Balanced Adaptive Routing in Two-Dimensional Meshes," Proc. 1st Int'l Symp. on High-Performance Computer Architecture, Jan. 1995, pp. 112-121.
[14] W. J. Dally and C. L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks," IEEE Trans. on Computers, vol. 36, no. 5, pp. 547-553, May 1987.
[15] Y. M. Boura and C. R. Das, "A Class of Partially Adaptive Routing Algorithms for n_dimensional Meshes," Proc. Int'l Conf. on Parallel Processing, vol. 3, pp.175-182, Aug. 1993.
[16] V. S. Adve and M. K. Vernon, "Performance Analysis of Mesh Interconnection Networks with Deterministic Routing," IEEE Trans. on Parallel and Distributed Systems, Vol. 5, No. 3, pp. 225-246, Mar. 1994.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top