完整後設資料紀錄
DC 欄位語言
dc.contributor.authorSheu, Jyh-Jian
dc.contributor.authorHsu, Lih-Hsing
dc.date.accessioned2009-08-23T04:39:12Z
dc.date.accessioned2020-05-25T06:24:54Z-
dc.date.available2009-08-23T04:39:12Z
dc.date.available2020-05-25T06:24:54Z-
dc.date.issued2006-10-30T01:39:41Z
dc.date.submitted1996-12-19
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/2864-
dc.description.abstractAssume the N and s are positive integers with 2s < N ≦ 2s+1. It is claimed by Auletta, Rescigno, and Scarano that the fault diameter of the supercube with N nodes, is exactly s + 1 if N € { 2s+1 -1, 2s+1 -2, 2s+2s-1 + 1},and s+2 otherwise. In this paper, we will argue that the above assertion is not correct. In stead, we will show that the fault diameter of the supercube with N nodes is s+1 if N €{2s+1 -2}∪{2s+1 – 2i∣ 0 ≦ i ≦ s-1},and s+2 otherwise. To get this goal, the shortest path routing algorithm for supercubes is also presented in this paper.
dc.description.sponsorship中山大學,高雄市
dc.format.extent5p.
dc.format.extent423573 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries1996 ICS會議
dc.subject.otherFault-Tolerant Architecture
dc.titleOn the Fault Diameter for Supercubes
分類:1996年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics001996000202.pdf413.65 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。