A Fault Tolerant Scheduling Heuristics for Distributed Real Time Embedded Systems

1. Kalla, H. Génération Automatique de Distributions/Ordonnancements Temps Réel Fiables et Tolérants aux Fautes. PhD Thesis, Mathematics, Sciences and Technologies of the Information, L’INPG, 2004. 179 p.Search in Google Scholar

2. Zhang, Y., K. Chakrabarty. Energy-Aware Adaptive Checkpointing in Embedded Real-Time Systems. – IEEE Computer Society Washington, DC, USA, Vol. 1, 2003, p. 10918.Search in Google Scholar

3. Liu, X., H. Ding, K. Lee, L. Sha, M. Caccamo. Feedback Fault Tolerance of Real-Time Embedded Systems – Issues and Possible Solutions, ACM New York, NY, USA, Vol. 3, April 2006, No 2, pp. 23-28.10.1145/1143489.1143495Search in Google Scholar

4. Dependability: Basic Concepts and Terminology. – In: J. C. Laprie, Ed. Dependability: Basic Concepts and Terminology. Dependable Computing and Fault-Tolerant Systems, Springer, Vienna, Vol. 5, 1992, pp. 3-245.10.1007/978-3-7091-9170-5_1Search in Google Scholar

5. Jalote, P. Fault-Tolerance in Distributed Systems. Prentice-Hall, Inc., 1994.Search in Google Scholar

6. Krakowiak, S. Tolérance aux fautes – 1 Introduction, techniques de base. Joseph Fourier University Sardes Project (INRIA and IMAG-LSR), 2004.Search in Google Scholar

7. Lopez, P. Approche par contraintes des problèmes d’ordonnancement et d’affectation: structures temporelles et mécanismes de propagation. Paris, France, Ellipses Marketing Edition S. A., 2004.Search in Google Scholar

8. Marouf, M. Ordonnancement temps réel dur multiprocesseur tolérant aux fautes appliqué à la robotique mobile. PhD Thesis, Real Time Computing, Robotics and Automation, Mines Paris Tech, 2012. 212 p.Search in Google Scholar

9. de Rauglaudre, D. Vérification formelle de conditions d’ordonnançabilité de tâches temps réel périodiques strictes. JFLA – Francophone Days of Business Languages, 2012, February 2012, Carnac, France, 2012.Search in Google Scholar

10. Girault, A., H. Kalla. A Novel Bicriteria Scheduling Heuristics Providing a Guaranteed Global System Failure Rate. – IEEE Trans. Dependable Sec. Comput., Vol. 6, 2009, No 4, pp. 241-254.10.1109/TDSC.2008.50Search in Google Scholar

11. Arar, C., M. S. Khireddine. An Algorithm Based on Replication and Deallocation Efficient Fault-Tolerant Multi-Bus Data Scheduling Algorithm Based on Replication and Deallocation. – Cybernetics and Information Technologies, Vol. 16, 2016, No 2, pp. 69-84.10.1515/cait-2016-0021Search in Google Scholar

12. Priyanka, M., S. Anisha, R. Sakthi Prabha. VLSI Design for a PSO-Optimized Real-Time Fault-Tolerant Task Allocation Algorithm in Wireless Sensor Network. – ARPN Journal of Engineering and Applied Sciences, Vol. 11, July 2016, No 13, pp. 8226-8230.Search in Google Scholar

13. Garg, R., S. A. Kumar. Fault Tolerant Task Scheduling on Computational Grid Using Checkpointing under Transient Faults. – Arabian Journal for Science and Engineering, Vol. 39, 2014, No 12, pp. 8775-8791.10.1007/s13369-014-1455-2Search in Google Scholar

14. Nagarajan, K., J. P. Hayes, B. T. Murray. Task Scheduling Algorithms for Fault Tolerance in Real-Time Embedded Systems. – In: D. R. Avresky, Ed. Dependable Network Computing. The Springer International Series in Engineering and Computer Science. Vol. 538. Boston, MA, Springer, 2000, pp. 395-412.10.1007/978-1-4615-4549-1_18Search in Google Scholar

15. Wilwert, C. Influence des Fautes Transitoires et des Performances Temps Réel sur la Sûreté des Systèmes X-by-Wire. PhD Thesis, Networks and Telecommunications [cs. NI]. National Polytechnic Institute of Lorraine – INPL, France 2005. 131 p.Search in Google Scholar

16. Donadeo, R. Tivoli Workload Scheduler for z/OS Conditional and Step Dependencies: When and How to Use Them to Shorten Workload Execution Time or to Automatically Handle Branching Scenarios. – IBM Rome Tivoli Lab Via Sciangai, 53 00144, Rome, Italy 2011, p. 21.Search in Google Scholar

17. Fan, W., F. Geerts, X. Jia. Conditional Dependencies: A Principled Approach to Improving Data Quality. – In: A. P. Sexton, Ed. Dataspace: The Final Frontier. BNCOD 2009. Lecture Notes in Computer Science. Vol. 5588. Berlin, Heidelberg, Springer, 2009, pp. 8-20.10.1007/978-3-642-02843-4_4Search in Google Scholar

18. Montresor, A. Distributed Algorithms Consistency & Replication. University of Trento, Attribution-ShareAlike 4.0 International License, Italy 2016.Search in Google Scholar

19. Holroyd, C. B., N. Yeung, M. G. H. Coles, J. D. Cohen. A Mechanism for Error Detection in Speeded Response Time Tasks. – Journal of Experimental Psychology: General, Vol. 134, 2005, No 2, pp.163-191.10.1037/0096-3445.134.2.16315869344Search in Google Scholar

20. Hashimoto, K., T. Tsuchiya, T. Kikuno. Effective Scheduling of Duplicated Tasks for Fault Tolerance in Multiprocessor Systems. – IEICE Transactions on Information and Systems, Vol. E85-D, 2002, No 3, pp. 525-534.Search in Google Scholar

21. Oh, Y., S. H. Son. Scheduling Real-Time Tasks for Dependability. – Journal of Operational Research Society, Vol. 48, 1997, pp. 629-639.10.1057/palgrave.jors.2600413Search in Google Scholar

22. http://www.syndex.orgSearch in Google Scholar