A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In  ... Alon for helpful discussions, and for referring me to  . ... The main result in  is a bounded de- gree network and a communication protocol for that network that achieves a.e.-agreement in the presence of up to O(n/ log n) faults. ...doi:10.1145/135419.135437 dblp:conf/podc/Upfal92 fatcat:76lnykqagvc75hk37rmvgu65bm
Reaching agreement on the identity of correct¬ ly functioning processors of a distributed system in the presence of random communication delays, failures and processor joins is a fundamental problem in ... Since then he has worked in the area of fault-tolerant distributed systems and protocols. ...
The potentially enormous overhead associated with communication and voting schemes of the algorithms put unique burdens on the scheduler as the efficiency of scheduling determines the suitability of the ... Task graph primitives are identified and it is shown how their scheduling directly influences the performance of the agreement algorithm. ... The distributed workload of interest is defined by the agreement algorithm used to consolidate results of replicated tasks in the presence of malicious acts, i.e. malicious faults. ...doi:10.1142/s0129626404001672 fatcat:d3ykgumag5ejjeacbhcci56aay
In parlicular, we hitroduce the notion of the decasion graph of a task. and show that cvcry problem whose 4.lcgisioil graph is disconnected cannot be solved in the presence of one faulty processor, By ... solves a given problem in spite of one hmity pro,.,2ssor if in any execution it sztisfies (i) all nonfauhy processors eventually halt, and (it) if no processor is faulty, it solves the problem, Hence. ... Acknowledgment We would like to thank the (anonymous) referee for some helpful comments, and in particular for ...doi:10.1016/0020-0190(87)90052-4 fatcat:xveqvth2ordn5jn7uyrbe6jmgm
Summary: “Achieving processor cooperation in the presence of faults is a major problem in distributed systems. ... We believe that in foreseeable technologies the number of faults will grow with the size of the net- work while the degree will remain practically fixed. ...
of non-trivial agreement in complete graphs in the presence of dynamic Byzantine faults. ... In this paper we are interested in synchronous distributed systems subject to transient and ubiquitous failures. ... Zaks for helpful discussions on some of these results over the years; and Yoram Moses and Sergio Rajsbaum for bringing reference  to the attention of the mainstream distributed computing community ...doi:10.1016/j.tcs.2007.04.036 fatcat:m5epaw3vanhfhlfrv2pmlvyrkm
Siu, Chin and Yang have indicated that the bound on the number of allowable faulty processors in Meyer and Pradhan's scheme is an overestimated one, and they have given a new fixed bound to the allowable ... The consensus is an important topic in the reliable distributed system because the system can cope with the influences from faulty components when the agreement is achieved. ... INTRODUCTION In order to ensure the reliability of the fault-tolerant distributed system, reaching a common agreement at the presence of malfunctioning components is the central issue. ...doi:10.1145/1075395.1075403 fatcat:2h46fvdvdnhq3mdu2hzj4zamwq
The consensus problem is concerned with the agreement on a system status by the fault-free segment of a processor population in spite of the possible inadvertent or even malicious spread of disinformation ... The resulting protocols are useful throughout fault-tolerant parallel and distributed systems and will impact the design of decision systems to come. ... In the area of fault-tolerant computing, the consensus problem is to form an agreement among the fault-free members of the resource population on a quantum of information in order to maintain the per-formance ...doi:10.1145/152610.152612 fatcat:kw33ziqa25f2rnqki62ix72zri
The processors and links in such a network can both be subjected to different types of fault simultaneously. ... The proposed protocol uses the minimum number of message exchanges and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach an agreement. ... INTRODUCTION EACHING agreement in the presence of faults is one of the most important problems in designing a fault-tolerant distributed system. ...doi:10.1109/71.667895 fatcat:wyzzh4uhtvg2barjgmh2jlivfq
Achieving processor cooperation in the presence of faults is a major problem in distributed systems. ... A simple corollary of the results of Dolev and Hadzilacos is that in order for a system to be able to reach Byzantine agreement in the presence of up to faulty processors, every processor must be directly ... For every t, if A is guaranteed to work correctly on H in the presence of at most + p(G, t) faults, then A(TS) achieves p(G, t) agreement on G in the presence of up to faults. ...doi:10.1137/0217061 fatcat:vsghupe7mzfnvdkv347nxe6ixu
The goal of solving the FDA problem is to make each healthy processor able to detect and locate the faulty components in the distributed system. ... In case Theorem 2: Each value ℜ ℜ ℜ ℜ jk in the same row of T_FDMAT should be the same value, if not, then the communication medium between processor P j and processor P k is faulty, for 1 ≤ ≤ ≤ ≤ ... INTRODUCTION Reaching a common agreement in the presence of faults is one of the most important problems in designing a reliable communication system. ...doi:10.1145/991130.991134 fatcat:dewsskduvbar7n5mzldalr4x5a
Various agreement protocols for the Byzantine generals problem have been summarized in terms of their performance and level of fault-tolerance. ... This paper is aimed at reviewing the notion of Byzantineresilient distributed computing systems, the relevant protocols and their possible applications as reported in the literature. ... In particular, reaching agreement in the presence of 'Byzantine faults' has gained significant attention of the researchers. ...doi:10.1007/bf02811312 fatcat:5dm5ga7sdndcxmnv4vcf2o5s5u
In 1998, Siu, Chin and Yang solve the BA problem in the presence of mixed faults on processors and links in the general network by protocol GPBA  . ... A loose coupled distributed system is a collection of processors that do not share memory or a clock, and each processor can communicate with each other processors through communication links in the un-fully ... The fault diagnosis phase In The reconfiguration phase Each processor uses the results of D_Links and A_Links from the fault diagnosis phase to reconfigure the network by isolating the faulty communication ...doi:10.3923/itj.2004.275.282 fatcat:jfsqyptlafgkpk3r5rtk4k5bbm
Once this total places a total order on messages and achieves distributed agreement even in the presence of fail-stoo. omission. timing, and communication faults. order is determined, distributed actions ... , broadcast messages, so that every working processor procthe Tram protocol, which provides efficient reliable broadcast communi-esses the same messages in the same order, provides an cation, and the Total ... While it is possible to reduce the number of fault-tolerant agreements required in distributed systems, a price is paid in design complexity and in risk of rollback. ...doi:10.1109/71.80121 fatcat:46qowx2bvndvdewx66dghf5ffy
This is to cope with the influence of faulty components. Reaching a common agreement in the presence of faults before performing certain tasks is essential. ... Fault-tolerance is an important research topic in the study of distributed systems. In a distributed system, cooperating tasks must achieve an agreement. ... Acknowledgements: This study is conducted under the Cloud computing systems and software development projects of the Institute for Information Industry which is subsidized by the Ministry of Economic Affairs ...doi:10.2306/scienceasia1513-1874.2013.39s.085 fatcat:hjua22rh7vgujekqdqo6ovxf4a
« Previous Showing results 1 — 15 out of 7,521 results