• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Y.: An active replication scheme that tolerates failures in dist. Embedded real-time systems (0)

by A Girault, H Kalla, Sorel
Venue:In: DSN (2003
Add To MetaCart

Tools

Sorted by:
Results 1 - 7 of 7

Article: Reliability-driven fault tolerant scheduling heuristics for distributed embedded real-time systems

by Salim Kalla, Hamoudi Kalla, Chafik Arar - International Journal of Computer Applications , 2011
"... We present a new scheduling approach to produce automatically a fault tolerant distributed schedule for critical distributed and real-time embedded systems. The approach that we propose take as input a set of operations (tasks), a target distributed architecture, some distribution constraints, some ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We present a new scheduling approach to produce automatically a fault tolerant distributed schedule for critical distributed and real-time embedded systems. The approach that we propose take as input a set of operations (tasks), a target distributed architecture, some distribution constraints, some indications on the execution times of the operations on the processors of the target architecture, some indications on the communication times of the data-dependencies on the media communications of the target architecture, and the reliability of processors. IT produces a fault-tolerant distributed and static scheduling of the operations on the architecture, with an indication whether or not the real-time constraints are satisfied. The scheduling approach that we propose for architectures with multiple processors linked by a set of channels (links), consist of a list scheduling heuristic based on active replication strategy. In order to reduce the probability of fault occurrence, the replication process of each operation is based on a Global System Failure Rate (GSFR) objective function. Finally, simulation results show the performance of our approach.
(Show Context)

Citation Context

...p://wwwrocq.inria.fr/syndex), a system level CAD software tool forsoptimizing the implementation of real-time embeddedsapplications on multi-components architectures. Prior work hassbeen published in =-=[22, 23, 24, 9]-=-.s3. MODELSs3.1 AlgorithmsThe algorithm is modeled by a data-flow graph, called algorithmsgraph and noted ALG. Each vertex of ALG is an operations(task) and each edge is a data-dependence. A data-depe...

Safe Allocation of Avionics Shared Resources

by Laurent Sagaspe, Gérard Bel, Pierre Bieber, Fréderic Boniol, Charles Castel
"... We propose an approach to analyse the safety of avionic systems that takes into account the impact of computation and communication resource sharing. The approach is made of three main steps: use a formal notation to describe how failures propagate in the system under study, use model-checking tools ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We propose an approach to analyse the safety of avionic systems that takes into account the impact of computation and communication resource sharing. The approach is made of three main steps: use a formal notation to describe how failures propagate in the system under study, use model-checking tools to verify safety requirements and to derive allocation constraints, use a constraint solver to generate safe allocations. This approach is illustrated by the study of the Terrain Following/Terrain Avoidance (TF/TA) System of a ghter aircraft.
(Show Context)

Citation Context

...which produce a topology (a relation between the three previous mentioned sets) that maximises reliability while ful ling cost, size, timing and reliability constraints. The work by Sorel and Girault =-=[11]-=- also combines functional, safety and real-time aspects but they propose to use specialized heuristics instead of a general purpose constraint solver in order to cope with combinatorial explosion of c...

unknown title

by Jorge-arnulfo Quiané-ruiz, Patrick Valduriez, P. Lamarre, P. Valduriez , 2011
"... Satisfaction-based query replication An automatic and self-adaptable approach for replicating queries in the presence of autonomous participants ..."
Abstract - Add to MetaCart
Satisfaction-based query replication An automatic and self-adaptable approach for replicating queries in the presence of autonomous participants
(Show Context)

Citation Context

...e times, because there is a system overhead for detecting provider failures, determining which queries have been stopped, and rescheduling stopped queries. On the other hand, active query replication =-=[9]-=- is more adequate in this context as it does not make this assumption. It allocates queries to the number of providers required by a consumer (called primary providers) plus some other providers (call...

Arvind Kumar et al. / International Journal on Computer Science and Engineering (IJCSE) Fault Tolerance in Real Time Distributed System

by Arvind Kumar, Rama Shankar Yadav, Anjali Jain
"... Abstract- In this paper we investigate the different techniques of fault tolerance which are used in many real time distributed systems. The main focus is on types of fault occurring in the system, fault detection techniques and the recovery techniques used. A fault can occur due to link failure, re ..."
Abstract - Add to MetaCart
Abstract- In this paper we investigate the different techniques of fault tolerance which are used in many real time distributed systems. The main focus is on types of fault occurring in the system, fault detection techniques and the recovery techniques used. A fault can occur due to link failure, resource failure or by any other reason is to be tolerated for working the system smoothly and accurately. These faults can be detected and recovered by many techniques used accordingly. An appropriate fault detector can avoid loss due to system crash and reliable fault tolerance technique can save from system failure. This paper provides how these methods are applied to detect and tolerate faults from various Real Time Distributed Systems.
(Show Context)

Citation Context

...ing technique and generate a fault tolerate distributed schedule. In this the algorithm based upon graph transformation can tolerate fixed number of arbitrary processor and communication link failure =-=[6]-=-. The graph is data flow graph shown in figure 4. in which the each vertex is an operation and each edge is data dependence. B A D C Figure 4. A data dependence graph. “Authors propose to use graph tr...

3.1.1. Synchronous formalisms 2

by Sophia Antipolis Rocquencourt
"... ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...d systems this heuristic implements a software solution. It is based on the redundancy of the operations (resp. data dependences) of the algorithm onto the processors (rep. links) of the architecture =-=[52]-=-[43]. The second one tolerates a fixed number of arbitrary processors and buses (multipoint communication medium) failures. This heuristic implements also a software solution but is based on the activ...

Autonomous Participants

by Jorge-arnulfo Quiané-ruiz, Patrick Valduriez, Thème Sym, Jorge-arnulfo Quiané-ruiz, Patrick Valduriez , 2009
"... apport de recherche ..."
Abstract - Add to MetaCart
apport de recherche

Information Systems Group

by Jorge-arnulfo Quiané-ruiz, Patrick Valduriez , 2011
"... L’objectif d’un système largement distribué sur Internet est d’intégrer des participants dont les spécificités et motivations ne sont pas toujours clairement identifiées a priori. En particulier, des participants autonomes peuvent avoir des intérêts individuels spécifiques vis-à-vis des requêtes, ma ..."
Abstract - Add to MetaCart
L’objectif d’un système largement distribué sur Internet est d’intégrer des participants dont les spécificités et motivations ne sont pas toujours clairement identifiées a priori. En particulier, des participants autonomes peuvent avoir des intérêts individuels spécifiques vis-à-vis des requêtes, mais aussi des autres participants. Dans un tel contexte, un système ne prenant pas en compte les individualités provoque des départs qui peuvent, par un effet domino, avoir des conséquences dévastatrices. La satisfaction des participants passe par la prise en compte de leurs intérêts lors de l’allocation des requêtes, mais elle peut aussi être affectée par les problèmes de pannes. La réplication des requêtes est une solution permettant de résoudre ce dernier problème. Cependant, la présence de participants autonomes rend cette approche plus délicate. Non seulement la réplication de requête peut rapidement surcharger les participants et le système, mais l’intérêt des participants à traiter des requêtes au cas où leurs collègues tombent en panne peut être assez faible. Les questions qui se posent alors naturellement sont est-il opportun de répliquer les requêtes?, mais aussi quelles requêtes répliquer? et dans ce cas avec quel niveau de réplication? Dans cet article, nous proposons des réponses à ces questions en revisitant le problème de la réplication du point
(Show Context)

Citation Context

...ter detection of a provider failure, the query to another provider. This approach, however, can significantly increase response times. An alternative solution is then query replication [1], [2], [3], =-=[9]-=-, [10], [25], which can be passive or active. Passive query replication (which is based on checkpointing or logging techniques [7], [8]) is not appropriate for dealing with autonomous participants. Th...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University