F.V. Brasileiro, "Constructing Fail-Controlled Nodes for Distributed Systems: A Software Approach," Ph.D. Thesis, University of Newcastle upon Tyne, May 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A fault-masking implementation of a path planner for an.. - Bekambo Deconinck (1996) (1 citation) (Correct)
....transputers that offer four bi directional links. 2.2.2. Fault Models One can distinguish two kinds of faults that may corrupt a system: consistent and Byzantine faults. Consistent faults are those likely perceived by all correct nodes. Consistent faults include fail silent and fail stop faults [POW92, BRAS95]. The second category of faults concerns those which are differently perceived by correct nodes. These faults include fail uncontrolled faults [LAMP82, BRAS95] as well as malicious ones. 5 2.2.3. Some examples In [LAMP82] two protocols are presented to allow a system to mask Byzantine faults. ....
....faults. Consistent faults are those likely perceived by all correct nodes. Consistent faults include fail silent and fail stop faults [POW92, BRAS95] The second category of faults concerns those which are differently perceived by correct nodes. These faults include fail uncontrolled faults [LAMP82, BRAS95] as well as malicious ones. 5 2.2.3. Some examples In [LAMP82] two protocols are presented to allow a system to mask Byzantine faults. In these protocols, one distinguishes two kinds of messages, oral and signed. An oral message is characterised by the following properties: a) the receiver ....
F. Brasileiro, Constructing Fail-Controlled Nodes for Distributed Systems: A Software approach, Ph. D. Thesis, 154 p., University of Newcastle upon Tyne, Computing Science Department, May 1995.
Timeout Based Message Ordering Protocols for.. - Ezhilchelvan.. Self-citation (Brasileiro) (Correct)
....been measured. In this section we describe the node versions implemented and illustrate their relative performance; we also compare the performance figures obtained against the expected values and thus validate our measurements. A detailed description of the implementation platform can be seen in [Brasil95a]. The experiments and the results reported here are more elaborate and extensive than the ones appeared in [Brasil95b] All the TMR versions implemented incorporate a majority voting protocol and output only a voted message which can be verified as such by any recipient of the message (see ....
F.V. Brasileiro, "Constructing Fail-Controlled Nodes for Distributed Systems: A Software Approach," Ph.D. Thesis, University of Newcastle upon Tyne, May 1995.
On the Design of the Seljuk-Amoeba Operating Environment - Brasileiro, Gallindo.. Self-citation (Brasileiro) (Correct)
....is imperative for achieving fault tolerance, thus for attaining a reliable processing service, it is necessary to replicate processes and execute them in different processors. The collection of processors that execute the replicated processes is normally referred to as a fail controlled node [11]. The basic approach for implementing a fail controlled node is to replicate the computation on a sufficiently large number of independent processors, which can fail in some less restrictive way (e.g. arbitrarily) Processors are driven by some synchronisation mechanism which guarantees that ....
....from appearing at the application level, ensuring the controlled failure semantics of the node. Speirs et al. 12] and Brasileiro et al. 13] describe software implementations of fail controlled nodes at the application level, which use the efficient replication management protocols presented in [11]. The Seljuk Amoeba fault tolerant processing service will provide both failure masking and failsilent processing services, by introducing the protocols studied in [11] at the micro kernel level of the Amoeba distributed operating system. This is achieved by developing a new Run Server, named ....
[Article contains additional citation context not shown here]
F.V. Brasileiro. Constructing Fail-Controlled Nodes for Distributed Systems: A Software Approach. Ph.D. Thesis, University of Newcastle upon Tyne, May 1995.
Timeout Based Message Ordering Protocols for.. - Ezhilchelvan.. Self-citation (Brasileiro) (Correct)
....been measured. In this section we describe the node versions implemented and illustrate their relative performance; we also compare the performance figures obtained against the expected values and thus validate our measurements. A detailed description of the implementation platform can be seen in [Brasil95a]. The experiments and the results reported here are more elaborate and extensive than the ones appeared in [Brasil95b] All the TMR versions implemented incorporate a majority voting protocol and output only a voted message which can be verified as such by any recipient of the message (see ....
F.V. Brasileiro, "Constructing Fail-Controlled Nodes for Distributed Systems: A Software Approach," Ph.D. Thesis, University of Newcastle upon Tyne, May 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC