Allowance-Fit: A partitioning algorithm for temporal robustness of hard real-time systems upon multiprocessors

ETFA 2009 - 2009 IEEE Conference on Emerging Technologies and Factory Automation

Volumn , Issue , 2009, Pages

  Fauberteau, Frédéric ^a   Midonnet, Serge ^a   George, Laurent ^b  

^a UNIVERSITÉ PARIS EST   (France)

^b Ecole Centrale Electroniques   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FIRST FIT; FIXED PRIORITY SCHEDULING; HARD REAL-TIME SYSTEMS; MULTIPROCESSOR SCHEDULING PROBLEMS; PARTITIONING ALGORITHMS; PARTITIONING STRATEGIES;

FACTORY AUTOMATION; MULTIPROCESSING SYSTEMS; PROBLEM SOLVING; SEMICONDUCTOR QUANTUM DOTS;

REAL TIME SYSTEMS;

EID: 77949876955     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ETFA.2009.5347249     Document Type: Conference Paper

References (12)

1. B. Andersson and J. Jonsson. Preemptive multiprocessor scheduling anomalies. In Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), page 0012. IEEE Computer Society, 2002.
2. S. K. Baruah and J. Goossens. Deadline monotonic scheduling on uniform multiprocessors. In T. P. Baker, A. Bui, and S. Tixeuil, editors, OPODIS, volume 5401 of Lecture Notes in Computer Science, pages 89-104. Springer, 2008.
3. L. Bougueroua. Conception de systèmes temps réel en environnement incertain. PhD thesis, Université de Paris 12, April 2007.
4. L. Bougueroua, L. George, and S. Midonnet. Dealing with execution-overruns to improve the temporal robustness of real-time systems scheduled fp and edf. In Proceedings of the 2nd International Conference on Systems (ICONS'07). IEEE Computer Press, April 2007.
5. M. Cirinei, E. Bini, G. Lipari, and A. Ferrari. A flexible scheme for scheduling fault-tolerant real-time tasks on multiprocessors. In Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), pages 1-8. IEEE, 2007.
6. J. E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation Algorithms for Bin Packing: A Survey, chapter 2, pages 46-93. PWS Publishing, 1996.
7. S. K. Dhall and C. L. Liu. On a real-time scheduling problem. Operations Research, 26(1):127-140, January-February 1978.
8. N. Fisher, S. K. Baruah, and T. P. Baker. The partitioned scheduling of sporadic tasks according to static-priorities. In Proceedings of the 18th Euromicro Conference on Real-Time Systems (ECRTS'06), pages 118-127, 2006.
9. L. George, N. Rivierre, and M. Spuri. Preemptive and non-preemptive real-time uniprocessor scheduling. Technical Report RR-2966, INRIA, Rocquencourt, France, September 1996.
10. R. Kirner and P. P. Puschner. Classification of wcet analysis techniques. In Proceedings of the International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2005), pages 190-199. IEEE Computer Society, 2005.
11. J. Y. T. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation, 2:237-25, December 1982.
12. D. Mossé, R. G. Melhem, and S. Ghosh. Analysis of a fault-tolerant multiprocessor scheduling algorithm. In Proceedings of the 24th Annual International Symposium on Fault-Tolerant Computing (FTCS 1994). IEEE Computer Society, June 1994.