| 題名: | Complete-rotation Graph : A New Interconnection Network |
| 作者: | Lee, Cheng-Ta Hsu, Chiun-Chieh |
| 關鍵字: | Interconnection network trivalent Cayley graph, degree four Cayley graph cube-connected-cycle complete-rotation graph optimal routing Cayley graph |
| 期刊名/會議名稱: | 2000 ICS會議 |
| 摘要: | This paper presents and analyzes a new interconnection network - complete-rotation graph. This network is an interesting candidate for massively parallel processing. Communication is a basic requirement of constructing a new interconnection network. Hence, we develop an optimal routing algorithm and a fault tolerant routing algorithm in complete-rotation graph. In addition, we can find that the degree and diameter of the complete-rotation graph are smaller than those of the hypercube when these two graphs have the same number of vertices. |
| 日期: | 2006-10-27T02:05:26Z |
| 分類: | 2000年 ICS 國際計算機會議 |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002000000063.pdf | 111.75 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。