Off-Line Real-Time Fault-Tolerant Scheduling

@inproceedings{Dima2001OffLineRF,
  title={Off-Line Real-Time Fault-Tolerant Scheduling},
  author={Catalin Dima and Alain Girault and Christophe Lavarenne and Yves Sorel},
  booktitle={PDP},
  year={2001}
}
Weaddresstheproblemof off-line fault tolerantscheduling of analgorithmontoa multiprocessorarchitecturewith distributedmemoryandprovidea genericalgorithmwhich solvesthis problem.We take into accounttwo kindsof failures: fail-silent andomission.Thebasictechniqueweuse is the replicationof operationsand data communications. We thendiscussthe principleswhich govern the execution of schedulingswith replicationunderthestate-machineand theprimary/backuparbitrationsbetweenreplicas.We also showhowto… CONTINUE READING
Highly Cited
This paper has 47 citations. REVIEW CITATIONS
34 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Sorel.Faulttolerantstaticschedulingfor real-timedistributedembedded systems. ResearchReport4006, INRIA, September2000

  • A. Girault, C.Lavarenne, M. Sighireanu, andY
  • Submittedto IEEE Trans.on Parallel…
  • 2000
2 Excerpts

An approachfor fault-tolerance in hardreal-timedistributedsystems.ResearchReport1257, IRISA, Rennes, France,July1999

  • P. ChevochotandI. Puaut
  • 1999
2 Excerpts

Sorel.Optimizedrapid prototyping for real-time embeddedheterogeneousmultiprocessors.In Proceedingsof 7th InternationalWorkshop onHardware/Softwar e Co-Design,CODES’99

  • T. Grandpierre, C. Lavarenne, andY
  • 1999
1 Excerpt

Radehoffer andM . Schroeder . Automaticreconfiguration in autonet

  • Th.
  • 1994

TTP / Athe fireworks protocol

  • H. Kopetz
  • 1994

TTP/A - the fireworks protocol. ResearchReport2̃3, Institut für TechnischeInformatik, TechnischeUniversiẗatWien,Wien,Austria,1994

  • H. Kopetz
  • 1994
1 Excerpt

Implementingfault - tolerantservicesusing the statemachineapproach : A tutorial

  • F. B. Schneider
  • ACM Computing Surveys
  • 1991

andD.S.Johnson.Computer sandIntractability, a Guideto theTheoryof NP-Completeness

  • M. R. Garey
  • 1979
1 Excerpt

Similar Papers

Loading similar papers…