Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  system diagnosis
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
EN
System diagnosis is process of identifying faulty nodes in a system. An efficient diagnosis is crucial for a multiprocessor system. The BGM diagnosis model is a modification of the PMC diagnosis model, which is a test-based diagnosis. In this paper, we present a specific structure and propose an algorithm for diagnosing a node in a system under the BGM model. We also give a polynomial-time algorithm that a node in a hypercube-like network can be diagnosed correctly in three test rounds under the BGM diagnosis model.
2
Content available remote The Diagnosability of(K4 - {e})-free Graphs under the PMC Diagnosis Model
EN
The ability of identifying all the faulty devices in a multiprocessor system is known as diagnosability. The PMC model is the test-based diagnosis with a processor performing the diagnosis by testing the neighboring processors via the links between them. In this paper, we discuss the diagnosability of a (K4–{e })-free graph under the PMC model.
3
Content available remote Design of diagnostic structures using genetic algorithm
EN
The article deals with problems encountered during designing diagnostic structures (DS) type PMC and BGM for networks with a fixed logical structure (topology). The paper presents an adaptive method that uses a genetic algorithm, which allows the designing of the most inexpensive DS for a given topology.
PL
W artykule rozpatrzono problemy występujące przy projektowaniu struktur opiniowania diagnostycznego (OD) dla sieci komputerowych o ustalonej strukturze logicznej (topologii). Przedstawiono adaptacyjną metodę, wykorzystującą algorytm genetyczny, która umożliwia projektowanie najtańszych struktur OD dla danej topologii.
EN
This paper describes a possibility of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. The notions of D-partition of the set of places P of a given place-transition net N and net k-distinguishability are first introduced. Next these two notions are extended to the set of all vertices, i.e., places and transitions of N. So the problem of fault identification of the vertices of N is transformed as a problem of fault identification of the places of a new net N' called a net simulator of N. Any transition in N' is assumed to be fault-free. To improve the inherent net fault distinguishability first some additional places called test points are introduced. Then, some structural properties concerning the net fault distinguishability measure are shown. The above mentioned possibility of using P-invariants in system diagnosis is dependent on the cardinality r of the corresponding P-cover of N. Hence the test point set reduction seems to be an important problem with respect to the required net fault distinguishability. In particular, it is shown that instead of (2/sup r/ - 1) r-variable intersection operations, for determination of the net k-distinguishability only 4r set operations can be used (3r 2-variable intersection operations, beginning with the computation of r sums of (r - 1) arguments, where r [right angle bracket]or= 3).
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.