完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Lee, Cheng-Ta | |
| dc.contributor.author | Hsu, Chiun-Chieh | |
| dc.date.accessioned | 2009-06-02T06:21:47Z | |
| dc.date.accessioned | 2020-05-25T06:37:27Z | - |
| dc.date.available | 2009-06-02T06:21:47Z | |
| dc.date.available | 2020-05-25T06:37:27Z | - |
| dc.date.issued | 2006-10-27T02:05:26Z | |
| dc.date.submitted | 2000-12-08 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2642 | - |
| dc.description.abstract | 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. | |
| dc.description.sponsorship | 中正大學,嘉義縣 | |
| dc.format.extent | 8p. | |
| dc.format.extent | 114433 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2000 ICS會議 | |
| dc.subject | Interconnection network | |
| dc.subject | trivalent Cayley graph, degree four Cayley graph | |
| dc.subject | cube-connected-cycle | |
| dc.subject | complete-rotation graph | |
| dc.subject | optimal routing | |
| dc.subject | Cayley graph | |
| dc.subject.other | Interconnection Network | |
| dc.title | Complete-rotation Graph : A New Interconnection Network | |
| 分類: | 2000年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002000000063.pdf | 111.75 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。