G. Bauer and H. Kopetz. Transparent Redundancy in the Time-Triggered Architecture. ICDSN 2000, June 2000, New York, NY, USA, Jun. 2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....units by grouping identical units with a voter. The basic idea of such faulttolerant units has already been proposed by John von Neumann [vN56] A di#erent approach [Kop90] employs fail silent units that produces either correct results or, in case of failure, no results at all. Bauer et. al [Bau00] show how TTP C can be extended by a Fault Tolerance Layer that performs those functions that are necessary for the implementation of application redundancy. In this approach, the hardware software interface of the host computer, where the application software is executing, remains unchanged in ....

G. Bauer and H. Kopetz. Transparent Redundancy in the Time-Triggered Architecture. ICDSN 2000, June 2000, New York, NY, USA, Jun. 2000.

.... on top of synchronous systems than on top of asynchronous systems; some algorithms even cannot be implemented on asynchronous systems [2, 4] Work and research has been done that takes advantage of and focuses on the properties of synchronous and asynchronous systems, respectively, such as [8, 3]. The work on synchronous systems focuses mainly on the operation of distributed systems in a state where all system properties are already guaranteed. However, after system start every system is basically asynchronous. Consequently, special algorithms, which we call start up algorithms, must ....

....of the checksum by the receiving node equals the checksum of the frame. Otherwise it is said to be incorrect. A failure of a node is tolerated (i.e. it is masked to the application) by replication of nodes and the use of, e.g. Triple Modular Redundancy (TMR) and correct voting algorithms [8]. 2.4.2 Fault Isolation A fault containment region (FCR) is a set of components that is considered to fail (a) as an atomic unit, and (b) in a statistically independent way with respect to other FCRs [6] In order to assure that a node is an FCR, i.e. that a fault affects only a node and ....

H. Kopetz and G. Bauer. Transparent redundancy in the Time-Triggered Architecture. In Proc. of Int. Conf. on Dependable Systems and Networks, pages 5--13, June 2000.

.... service is also exploited internally by TTA, to allow it to operate in the presence of multiple faulty clocks (synchronization is performed only over nodes that are in the membership) A proposed extension to TTA is a service that supports state machine replication in a transparent way [KB00] The idea is to identify some of the state variables of an application as ones that should be voted. Exchange and voting of those variables is then managed by the TTA controllers in a way that is transparent to the application. This is accomplished by locating the voted variables in that area of ....

Hermann Kopetz and Gunther Bauer. Transparent redundancy in the timetriggered architecture. In The International Conference on Dependable Systems and Networks, pages 5--13, New York, NY, June 2000. IEEE Computer Society.

....coverage. 5. 4 Cost of error detection mechanisms Obviously, since Hades (execution mechanisms and fault tolerance mechanisms) is entirely implemented in software on top of a COTS real time kernel, the response times of its services are larger than those of hardware assisted systems (e.g. TTP [4] and Spring [28] and those of real time kernels. It is thus of prime importance to evaluate Hades timing performance, and in particular the performance of its error detection mechanisms, in order to identify the time criticality of the target applications of Hades (and similar systems entirely ....

....Mars project was the design and implementation of a distributed faulttolerant architecture for hard real time applications. The project started in 1980 at the Technical University of Vienna and gave birth to several implementations in the context of dioeerent European and or industrial projects [18, 26, 4]. One key characteristic of the different implementations of Mars over the twenty last years are their completely deterministic behavior even under peak load conditions. To achieve this determinism, Mars is strictly time driven and periodic: CPU and network occupation are scheduled ooe line. ....

G. Bauer and H. Kopetz. Transparent redundancy in the time-triggered architecture. In Proc. of the International Conference on Dependable Systems and Networks (FTCS-30 and DCCA-8), pages 513, New York, USA, June 2000.

....determinism within the complete node. The three replicas of the host software run synchronously on the three different host computers and produce their output simultaneously (within the precision of the clock synchronization) at their FTU CNI (cf. Figure 11) before the a priori known fetch instant [55]. The FTU layer distributes the messages to the other nodes of the cluster. Immediately before the a priori determined delivery instant of a message at the FTU CNI of receiving nodes, the FTU layer at the respective nodes vote on the incoming messages from the nodes of the FTU and present the ....

G. Bauer and H. Kopetz. Transparent Redundancy in the Time-Triggered Architecture. In Proceedings of the International Conference on Dependable Systems and Networks, pages 5--13, 2000.

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