Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 10 of 10 for “"Crash faults"”.
-
Dining philosophers with masking tolerance to crash faults
… dining philosopher algorithms subject to process crash faults in arbitrary conflict graphs. This classic problem is unsolvable in asynchronous message-passing systems subject to even a single crash fault. By contrast, dining can be solved in synchronous systems capable of implementing the perfect …
-
Creation and maintenance of a communication tree in wireless sensor networks
… in the dissertation. For routing around crash fault nodes, a communication tree structure connecting sensor nodes to the base station (sink or root) is dynamically reconfigured during information dissemination. Unlike other location based routing approaches, INP does not take any support …
-
The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers
… its critical section, regardless of process crashes. Eventual weak exclusion guarantees that every execution has an infinite suffix during which no two live neighbors execute overlapping critical sections. Eventual bounded fairness guarantees that there exists a fairness bound k such that …
-
Anchor: Bridging the Gap between Paxos Efficiency and Raft Simplicity
… οφείλονται σε απλές διακοπές λειτουργίας κόμβων (crash faults), αποφεύγοντας έτσι το πρόσθετο κόστος μηχανισμών που χειρίζονται κόμβους με αυθαίρετη ή κακόβουλη συμπεριφορά (byzantine faults). Εστιάζει στην απόδοση, την κλιμάκωση και την εύκολη υλοποίηση. Χρησιμοποιεί κυκλική εναλλαγή ηγεσίας και …
-
Active replication vs. fusion as fault tolerance mechanisms
This report compares two strategies for crash fault tolerance of nodes in distributed systems: active replication and fusion. To tolerate f crash faults, active replication maintains f backup servers for each primary. Fusion, however, maintains a set of f backup servers that contain the replicated …
-
Byzantine fault tolerance in autonomous robots evacuation problems
… on a circle addressing scenarios that involve f crash faults or one Byzantine fault. We extend the discussion to circle evacuation under one and two Byzantine faults and under f Byzantine faults presenting detailedalgorithms and conducting an in-depth analysis of their time requirements.
-
Scalable Byzantine State Machine Replication: Designs, Techniques, and Implementations
… distributed infrastructures. The widely used Crash Fault Tolerance (CFT) fault model of consensus protocols is prone to malicious and adversarial behaviors as well as non-crash faults such as software bugs. The Byzantine fault-tolerance (BFT) model and its trust-based variant, the hybrid …
-
Byzantine fault tolerant web applications using the UpRight library
… fault tolerant protocols in order to tolerate crash faults. However, recent system-wide failures have been caused by arbitrary or Byzantine faults which these applications are not capable of handling. Despite the abundance of research on adding Byzantine fault tolerance (BFT) to a system, BFT …
-
Distributed computing with mobile agents: Solving rendezvous and related problems
… in mobile agent systems when some of agents crash unexpectedly. Our results show that any problem that can be solved in message-passing systems can be solved in mobile agent systems while tolerating any number of crash faults, short of a total system collapse.
-
A Prescription for Partial Synchrony
… often require partial synchrony to tolerate crash failures. Informally, partial synchrony refers to systems where timing bounds on communication and computation may exist, but the knowledge of such bounds is limited. Traditionally, the foundation for the theory of partial synchrony has been …