Characterization of Connection Assignment of Diagnosable Systems
From MaRDI portal
Publication:4404788
DOI10.1109/T-C.1974.223782zbMath0278.94018MaRDI QIDQ4404788
Ashok T. Amin, S. Louis Hakimi
Publication date: 1974
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items
Reliability analysis of the cactus-based networks, On the \(t/k\)-diagnosability of BC networks, Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model, On the covering of vertices for fault diagnosis in hypercubes, Local diagnostication in computer systems with the circulant structure, On the diagnosability problem for a general model of diagnosable system, The strong local diagnosability of a hypercube network with missing edges, An analysis of self-diagnosis model by conditional fault set, An efficient algorithm for multiprocessor fault diagnosis using the comparison approach, Diagnosis in hybrid fault situations under AIM and a unified t- characterization theorem, A diagnosis algorithm by using graph-coloring under the PMC model, Probabilistic diagnosis of clustered faults for shared structures, A diagnosability analysis by means of fault distance, A formal method for determining the state of processors in a multiprocessor system under testing, A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model, Syndrome-decoding algorithms for static-diagnosis models, Random and conditional \((t,k)\)-diagnosis of hypercubes, Fault isolation and identification in general biswapped networks under the PMC diagnostic model, Conditional diagnosability of arrangement graphs under the PMC model, An approach to conditional diagnosability analysis under the PMC model and its application to torus networks, Monitoring of perception systems: deterministic, probabilistic, and learning-based fault detection and identification, \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model, The \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networks, A new method to test system diagnosability, The pessimistic diagnosability of data center networks, The diagnosability of triangle-free graphs, Analysis of the possibility of local diagnosis in computer systems with circulant structure based on redundancy in the number of analyzed testing results, The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model, A fast fault-identification algorithm for bijective connection graphs using the PMC model, Complexity of the diagnosability problem for a general model of diagnosable systems, Optimal adaptive fault diagnosis for simple multiprocessor systems, On fault identification in interconnection networks under the comparison model, Conditional diagnosability and strong diagnosability of split-star networks under the PMC model, Fault diagnosability of DQcube under the PMC model, The diagnosability and 1-good-neighbor conditional diagnosability of hypercubes with missing links and broken-down nodes, Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems, Constructing optimal subnetworks for the crossed cube network, Fault diagnosis in hypercube multiprocessor systems, Conditional diagnosability of a class of matching composition networks under the comparison model, Strong diagnosability of regular networks under the comparison model, Performance analysis of an evolutionary algorithm for fault detection int-diagnosable multi-processor systems, On sequential diagnosis of multiprocessor systems, Unnamed Item, A parallel genetic algorithm for identifying faults in large diagnosable systems, Distributed Corruption Detection in Networks, Partial and complete local diagnosis in computer systems with circulant structure, \(R_g\) conditional diagnosability: a novel generalized measure of system-level diagnosis, Number of mutual connections in neighborhoods and its application to self-diagnosable systems, Scheduling multiprocessor tasks -- An overview, The Diagnosability of (K4 – {e})-free Graphs under the PMC Diagnosis Model, Performance evaluation on hybrid fault diagnosability of regular networks, Scheduling independent 2-processor tasks to minimize schedule length, Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks, Fault-diagnosis of grid structures.