Fault Diagnosis Agreement

8 Dec

Toueg S, Perry KJ, Srikanth TK: chord distributed quickly. SIAM J Comput 16: 445-458 (1987) Reliability is an important research topic in distributed systems. To achieve adequate reliability, it is necessary to examine the margin of error of distributed systems. One of the main problems related to the margin of error is the problem of the Byzantine Agreement (BA). BA`s goal is to reach a common agreement with flawless processors, even in the event of persistent errors. Similarly, an Error Diagnosis Agreement (FDA) should be considered, with the goal of each flawless processor detecting/locating a common set of defective processors. In general, FDA protocols require ⌊ (n) 1)/3⌋ 2 message exchange rounds to detect/locate defective components, even if the number of defective processors is present. The number of messages leads to a significant logging effort. In this study, the FDA`s problem is addressed at an early stage by an evidence-based error diagnostic protocol that uses the minimum number of towers characterized by double processor failure.

In addition, the proposed protocol can detect/locate the maximum number of defective processors in a network. Bar-Noy A, Dolev D, Dwork C, Strong HR: gearbox: change the algorithms in flight to speed up the Byzantine chord. Inform Comput 97: 205-233 (1992) Due to the recent popularity of distributed systems, the reliability of distributed systems has become increasingly important in the latest research. At the same time, the diagnosis of errors has also become an important topic. For example, in many existing research, Siu et al. [11] proposed the GPBA protocol to resolve mixed errors on both processors and connections in a general network with compliance with BA rules. Another protocol, which was proposed by the same authors, FDAMIX, was then introduced into Blur automatons for error diagnosis. The output of the supervised system is partitioned into linear segments, which are in turn assigned to sample classes (models) using adhesion functions. A sequence of models is generated and becomes input for automatic slot machines that have transitions corresponding to the models of the system that works properly. When the dispensers reach their final state, i.e. the entry sequence is accepted by the vending machines with a degree of limb that exceeds a certain threshold, then normal operation is derived, otherwise an error is diagnosed.

Diagnosis of direct current engine failure and detection of anomalies in the ECG signal are used as case studies. Burns JE, Neiger G: Fast and simple Byzantine tuning. Technical representative 92/12. College of Computing, Georgia Institute of Technology 1992 Dolev D, Reischuk R: Bounds on information exchange for Byzantine agreement. J ACM 32: 191-204 (1985) Brian A. Coan received the B.S.E. in 1977. In electrical and computer engineering at Princeton University in 1979, the M.S. graduated in computer science from Stanford University and in 1987, the Ph.D. in computer science from the Massachusetts Institute of Technology.

He has worked for amdahl Corporation and AT-T Bell Laboratories. Since 1987, he has been a member of the technical staff of Bellcore`s Network Systems Research Department. His research focuses on distributed systems, the margin of error and platforms to support distributed multimedia systems. Moses Y, Waarts O: Coordinated Transgeneration: (t-1) -Byzantine Tour to Polynôme. Proc 29th Symp on Foundations of Computer Science 1988, p. 246-255 The reliability of the distributed system has become increasingly important with the rapid growth of the Internet. In the design of a distributed margin of error system, the Byzantine Agreement (BA) [2], [4], [6], [7], [10], [11], [12], [13], [14] is one of the main considerations. In many circumstances, a flawless processor can make an agreement in a distributed system before performing clear tasks [1], [2], [3]. For example, a well-known form of this problem, the transaction problem [3], is that all data processors involved in processing a given transaction have an agreement to record or reject the transaction results in the database.

Comments are closed.