A Rearrangeable Nonblocking Binary Tree Switching Network

View Statistics Email Alert RSS Feed

Information

Details

Project title

Code/計畫編號

NSC98-2221-E019-022

Translated Name/計畫中文名

可重新排列非延滯二元樹交換網路

Project Coordinator/計畫主持人

Mao-Hsu Yen

Funding Organization/主管機關

National Science and Technology Council

Co-Investigator(s)/共同執行人

謝慶發

Department/Unit

College of Electrical Engineering and Computer Science

Website

https://www.grb.gov.tw/search/planDetail?id=1917119

Year

2009

Start date/計畫起

01-08-2009

Expected Completion/計畫迄

31-07-2010

Bugetid/研究經費

620千元

ResearchField/研究領域

資訊工程--硬體工程

二元胖樹(binary fat tree)使用內部節點將左子樹、右子樹、父子樹上的端點相互連接。在本計劃中，我們第一個提出可重新安排二元樹交換網路 (rearrangeable binary tree switching network, BTSNU)，且針對階層式的連接架構所使用。BTSNU 主要包含了數個開關區塊(switch blocks)、連接閂 (crossbars)。另外也有以clique 架構為基礎，所衍伸的交換網路，BTSNC。既使與BTSNU 有相同開關區塊數量，甚至每一個開關區塊內的開關個數相同的情況，BTSNC 不會是一個可重新安排的交換網路。而在我們所提出的交換網路中，所需要的開關個數以N3/2 成比例，其中N 為連接端點數量。除此之外，我們已經成功將此BTSNU 交換網路成功的使用在一些繞線架構上。在本計劃中，我們將以可重新安排二元樹交換網路為基礎，分成兩年來發展出此交換網路。第一年的計畫裡，我們主要針對二元樹交換網路提出 BTSNU 的架構，並將此實現在soft IP 上。利用實驗的方式，檢驗BTSNU 中的參變數對此架構的效能影響。而第二年的計畫，我們提出BTSNU 的VLSI 架構以及繞線演算法，且實現在hard IP 上。最後，透過合併硬體架構和 BTSNU 架構所需要的程式，完成整個交換網路的系統。未來，經過這兩年的計畫，我們將針對可重新安排非延滯二元樹交換網路，設計一個完整的軟硬體系統，包含了硬體架構以及軟體工具。另外，在研究的過程中，不僅提升交換網路架構的創新，以及培植了高性能硬體系統設計人才。 A binary fat tree uses an internal node to interconnect the left-children, right-children and parent terminals to each other. In this project, we first propose a rearrangeable binary tree switching network (BTSNU) for the hierarchical interconnection. The main component of this BTSNU consists of many switch blocks and crossbars. With the same size and the same number of switches as our BTSNU, a clique-based BTSNC switching network is shown not rearrangeable. We derive that a rearrangeable three-sided switching network with switches proportional to N3/2 is most suitable to interconnect N terminals. Besides, this BTSNU switching network has been successfully applied to the design of routing architecture. Based on the rearrangeable and nonblocking binary tree switching network BTSNU, our project will span two stages as described in the following. In the first year’s project, we are mainly proposing the BTSNU architecture for binary tree switching network. We will implement it in the form of a soft IP. We examine the effect of the parameters of the BTSNU on the system level performance using the benchmarks. During the second year, we will present VLSI architecture and routing algorithm for the BTSNU; we will also implement the BTSNU in the form of a hard IP. In this stage, we will integrate the hardware and software of the BTSNU binary tree switching network. Finally, the hardware core and the software of the BTSNU will be incorporated into the switching network system. By the end of our two-year project, we will have a solid, feasible hardware and software for BTSNU, which has been validated on the target BTSNU. We will have a novel BTSNU technique for routing applications. The students taking part in this project will be the future design engineers in our growing switching network industry.

Keyword(s)

可重新安排
無延滯
二元樹
可重新安排交換網路
非延滯交換網路
rearrangeable
nonblocking
binary tree
rearrangeable switchingnetwork
nonblocking switching network

DSpace CRIS

A Rearrangeable Nonblocking Binary Tree Switching Network

Details

Description