816 Hits in 4.5 sec

A Membership Agreement Algorithm Detecting and Tolerating Asymmetric Timing Faults [chapter]

Håkan Sivencrona, Mattias Persson, Jan Torin
IFIP International Federation for Information Processing  
Our paper presents a new membership agreement algorithm that address asymmetric timing faults and includes a new tool simulating TTP/C clusters.  ...  The gathered results show the rare faults, which made a network using the original algorithm either collapse or become degraded, are detected and handled with the new algorithm without loss of more than  ...  CONCLUSION We have presented an algorithm for increasing the tolerance against asymmetric timing faults in a time-triggered protocol (TTP-C1).  ... 
doi:10.1007/1-4020-8149-9_7 dblp:conf/ifip10-3/SivencronaPT04 fatcat:6kcydabugnevfbtmii6htdd2hu

An Overview of Formal Verification for the Time-Triggered Architecture [chapter]

John Rushby
2002 Lecture Notes in Computer Science  
Some of these algorithms pose formidable challenges to current techniques and have been formally verified only in simplified form or under restricted fault assumptions.  ...  We describe formal verification of some of the key algorithms in the Time-Triggered Architecture (TTA) for real-time safety-critical control applications.  ...  Acknowledgments Günther Bauer of TU Vienna provided helpful comments and corrections for a previous version of this paper.  ... 
doi:10.1007/3-540-45739-9_7 fatcat:7l53ixpp4fa4topkufrp6hnahe

Bus Architectures for Safety-Critical Embedded Systems [chapter]

John Rushby
2001 Lecture Notes in Computer Science  
These requirements lead to a need for mechanisms and services that provide protection against fault propagation and ease the construction of distributed fault-tolerant applications.  ...  The problems of fault tolerance, partitioning, and strong composability are challenging ones.  ...  and Cooperative Agreement NCC-1-377 with Honeywell Incorporated.  ... 
doi:10.1007/3-540-45449-7_22 fatcat:wcywwlbhd5a7lmer2mavuf35yi

Total order broadcast and multicast algorithms

Xavier Défago, André Schiper, Péter Urbán
2004 ACM Computing Surveys  
Total order broadcast and multicast (also called atomic broadcast/multicast) present an important problem in distributed systems, especially with respect to fault-tolerance.  ...  This article proposes a classification of total order broadcast and multicast algorithms based on their ordering mechanisms, and addresses a number of other important issues.  ...  Schlichting, Tatsuhiro Tsuchiya, and Matthias Wiesmann, as well as Fred B. Schneider, and the anonymous reviewers. We are also thankful to Judith Steeh for proofreading this text.  ... 
doi:10.1145/1041680.1041682 fatcat:hl2evvvb2zfrlhzzcrnyctdcfe

Application-Level Diagnostic and Membership Protocols for Generic Time-Triggered Systems

M Serafini, Péter Bokor, N Suri, J Vinter, A Ademaj, Wolfgang Brandstätter, Fulvio Tagliabò, J Koch
2011 IEEE Transactions on Dependable and Secure Computing  
We present on-line tunable diagnostic and membership protocols for generic time-triggered (TT) systems to detect crashes, send/receive omission faults and network partitions.  ...  The information on detected faults is accumulated using a penalty/reward algorithm to handle transient faults.  ...  The opinion of a node about itself is considered unreliable and discarded to tolerate asymmetric faults.  ... 
doi:10.1109/tdsc.2010.23 fatcat:ko7k2iffzvhqje6ymi63luudfy

Design and Implementation of a Corba Fault-Tolerant Object Group Service [chapter]

Graham Morgan, Santosh Shrivastava, Paul Ezhilchelvan, Mark Little
1999 Distributed Applications and Interoperable Systems II  
The service is both dynamic and fault-tolerant: ordering and liveness is preserved even if membership changes occur due to (real or suspected) member failures, voluntary member departures and new group  ...  Both symmetric and asymmetric total order protocols are supported, permitting a member to use say symmetric version in one group and asymmetric version in another group simultaneously.  ...  A client of the Newtop service creating a group may decide if the group is to be lively or event driven: • • 4 A CORBA FAULT-TOLERANT OBJECT GROUP SERVICE 371 Lively -time-silence mechanism and failure  ... 
doi:10.1007/978-0-387-35565-8_29 fatcat:w43zpplgbndujmccq6mkbrxt5e

The customizable fault/error model for dependable distributed systems

C.J. Walter, N. Suri
2003 Theoretical Computer Science  
Given the variety and multiplicity of fault types, to simplify the design process, the system algorithm design often focuses on speciÿc fault types, resulting in either over-optimistic (all fault permanent  ...  The types and number of faults covered by a system play a primary role in determining the level of dependability which that system can potentially provide.  ...  Hugue for the valuable inputs and extensive technical discussions over this work. We also thank Arshad Jhumka for his editorial help.  ... 
doi:10.1016/s0304-3975(01)00203-1 fatcat:eo6dvwbtcba33h5jt7467k4po4

Consistent Global Data Structure in MANET

K.K. Basheer, V.Venkata Ramana, A. Rama Mohan Reddy
2010 International Journal of Computer Applications  
The performance and fault-tolerance requirements are a set of properties that apply to executions of the state machine.  ...  However, no final agreement yet exists about a general specification of a partition able group membership service.  ... 
doi:10.5120/1086-1417 fatcat:5dzn65p26bhb7hkir5w6oc262y

Interactive Consistency on a Time-Triggered Real-Time Control Network

Colin Ryan, Donal Heffernan, Gabriel Leen
2006 IEEE Transactions on Industrial Informatics  
In addition to guaranteeing a high level of reliability, these communication systems should facilitate the development of fault-tolerant applications.  ...  This paper describes the adoption of an explicit interactive consistency algorithm on a time-triggered broadcast communication system, using a shared communication medium.  ...  This asymmetric fault-free stage generates agreement between nodes.  ... 
doi:10.1109/tii.2006.885189 fatcat:zyxmtc5cvffp7l5gdaal5iogra

A group membership protocol for communication systems with both static and dynamic scheduling

V. Rosset, P.F. Souto, F. Vasques
2006 2006 IEEE International Workshop on Factory Communication Systems  
We present a group membership protocol specially designed for next generation communication systems for real-time safety-critical applications such as FlexRay and FTT-CAN.  ...  The proposed protocol imposes an overhead of two bits per processor per communication cycle, when the system is in a quiescent state, and is able to tolerate benign failures of up to half of the group  ...  Acknowledgments The authors would like to thank to Joaquim Ferreira for his review of a previous version of this paper, and the anonymous referees for their comments and suggestions.  ... 
doi:10.1109/wfcs.2006.1704119 fatcat:d6v2m4q5vnb23irqnwab24a2pu

A Replication-Based Fault Tolerance Protocol Using Group Communication for the Grid [chapter]

Kayhan Erciyes
2006 Lecture Notes in Computer Science  
We describe a replication-based protocol that uses group communication for fault tolerance in the Computational Grid.  ...  The Grid is partitioned into a number of clusters and each cluster has a designated coordinator that manages the states of the replicas within its cluster.  ...  Fault tolerance schemes in the Grid environment can be classified as the application specific fault tolerance based on middleware fault detection; task and data replication at middleware and transport  ... 
doi:10.1007/11946441_62 fatcat:exxbps4kxzet5lh3iwbdn7stma

Implementing Agreement Protocols in Sensor Networks

Andreas Achtzehn, Zinaida Benenson, Christian Rohner
2006 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Sysetems  
We identify several scenarios where agreement can be used, and report on our experience with implementing an agreement protocol.  ...  We investigate application of agreement protocols tolerating malicious failures in sensor networks.  ...  Group management: Leader election and group membership protocols from classical distributed systems could also be used in sensor networks for secure and fault-tolerant decentralized selection of cluster  ... 
doi:10.1109/mobhoc.2006.278665 dblp:conf/mass/AchtzehnBR06 fatcat:sirl6ba4drgzjksse43i2iyuju

TTP-a protocol for fault-tolerant real-time systems

H. Kopetz, G. Grunsteidl
1994 Computer  
It provides the services required for the implementation of a fault-tolerant real-time system: predictable message transmission, message acknowledgment in group communication, clock synchronization, membership  ...  Given a specified load and fault hypothesis, the computer architecture must assure a predictable and small bounded maximum latency between a stimulus from and a response to the environment.  ...  and Lorenz Lercher.  ... 
doi:10.1109/2.248873 fatcat:uy5lgiopfzhvniuri7lw3es2k4

Stable and Consistent Membership at Scale with Rapid [article]

Lalith Suresh, Dahlia Malkhi, Parikshit Gopalan, Ivan Porto Carreiro, Zeeshan Lokhandwala
2018 arXiv   pre-print
Implementing these insights translates into a simple membership algorithm with low communication overhead.  ...  We present the design and evaluation of Rapid, a distributed membership service.  ...  It provides fault tolerance by running the view-change consensus protocol only among a sampled subset of the membership set.  ... 
arXiv:1803.03620v1 fatcat:upeuvymggjdypexjvmznyzt4lq

The Time-Triggered Architecture [chapter]

Hermann Kopetz
2011 Real-Time Systems Series  
A large real-time application is decomposed into nearly autonomous clusters and nodes, and a fault-tolerant global time base of known precision is generated at every node.  ...  This paper presents the architecture model of the TTA, explains the design rationale, discusses the time-triggered communication protocols TTP/C and TTP/A, and illustrates how transparent fault tolerance  ...  ACKNOWLEDGMENT The authors would like to thank all Ph.D. students, master students, sponsors, and industrial partners that have contributed to the development of the TTA over a period of two decades.  ... 
doi:10.1007/978-1-4419-8237-7_14 fatcat:qfkqmyqeuvckzaeqtsjkgfh4zy
« Previous Showing results 1 — 15 out of 816 results