完整後設資料紀錄
DC 欄位語言
dc.contributor.author林銘皇en_US
dc.contributor.authorErmin Min-Huang Linen_US
dc.contributor.author譚建民en_US
dc.contributor.authorJimmy J. M. Tanen_US
dc.date.accessioned2014-12-12T02:56:56Z-
dc.date.available2014-12-12T02:56:56Z-
dc.date.issued2005en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT009323605en_US
dc.identifier.urihttp://hdl.handle.net/11536/79136-
dc.description.abstract在這篇論文裡,我們介紹了一個新的衡量錯誤診斷能力的方法,稱為局部診斷能力。依據不同的觀點,來做不同的詮釋研究,從原本廣域的觀點轉換成局部的觀點來觀察。在新的觀點下,我們展示了一個簡單的方法來診斷一個多處理機系統。我們把局部診斷能力的研究應用在連線無損壞的k元n維立方體上,並觀察得每個點的價數(degree)即為其局部診斷能力。接著我們把局部診斷能力的研究應用在有任意連線損壞 的k元n維立方體上。根據我們在這篇論文裡的証明,在任意的損壞連線數不超過2n−2個數時,每點的局部診斷能力仍為每點的價數。此外,我們提出了一個更為有效率的演算法來診斷錯誤的發生。zh_TW
dc.description.abstractIn this thesis, we introduce a new measure for diagnosability, called local diagnosability, by changing the original global viewpoint to a local viewpoint. With this new viewpoint, we yield an easy way to diagnose a multiprocessor system. We apply the concept of local diagnosability to k-ary n-cube with no missing links and the local diagnosability of each node is exactly the degree of each node. Then we investigate the local diagnosability of k-ary n-cube with arbitrarily distributed missing links. Based on the result proved in this thesis, the number of missing links can be up to 2n−2 and the local diagnosability of each node is the remaining degree of each node. Moreover, we propose a more efficient diagnosis algorithm.en_US
dc.language.isoen_USen_US
dc.subject診斷能力zh_TW
dc.subject局部診斷能力zh_TW
dc.subjectk元n維立方體zh_TW
dc.subject價數zh_TW
dc.subjectdiagnosabilityen_US
dc.subjectlocal diagnosabilityen_US
dc.subjectk-ary n-cubeen_US
dc.subjectdegreeen_US
dc.title在PMC模式下對k元n維立方體局部診斷能力之研究zh_TW
dc.titleLocal Diagnosability of k-ary n-cube Networks under the PMC Modelen_US
dc.typeThesisen_US
dc.contributor.department資訊科學與工程研究所zh_TW
顯示於類別:畢業論文


文件中的檔案:

  1. 360501.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。