English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105672 (86%)
Visitors : 12185528      Online Users : 635
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/25398


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/25398


    Title: An Algorithmic Approach to Conditional-Fault Local Diagnosis of Regular Multiprocessor Interconnected Systems under the PMC Model
    Authors: Cheng-Kuan, L;Lin, Cheng-Kuan;龔自良;Kung, Tzu-Liang;Kueng, Tz-Liang;Jimmy, J.M.T;Jimmy, J.M.Tan
    Contributors: 資訊工程學系
    Date: 2013-03
    Issue Date: 2013-07-11 14:19:45 (UTC+8)
    Abstract: System-level diagnosis is a crucial subject for maintaining the reliability of multiprocessor interconnected systems. Consider a system composed of N independent processors, each of which tests a subset of the others. Under the PMC diagnosis model, Dahbura and Masson proposed an O(N^{2.5}) algorithm to identify the set of faulty processors in a t-diagnosable system, in which at most t processors are permanently faulty. In this paper, we establish some sufficient conditions so that a t-regular system can be conditionally (2t-1)-diagnosable, provided every fault-free processor has at least one fault-free neighbor. Because any t-regular system is no more than t-diagnosable, the approached diagnostic capability is nearly double the classical one-step diagnosability. Furthermore, a correct and complete method is given which exploits these conditions and the presented branch-of-tree architecture to determine the fault status of any single processor. The proposed method has time complexity O(t^2), and thus can diagnose the whole system in time O(t^2 N). In short, not only could the diagnostic capability be proved theoretically, but also it is feasible from an algorithmic perspective.
    Relation: IEEE TRANSACTIONS ON COMPUTERS,V.62 N.3 : 439-451.
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML336View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback