Scheduling Analysis and Correction of Periodic Real Time Systems with Tasks Migration

  • Faten Mrabet
  • Walid Karamti
  • Adel Mahfoudhi
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 736)


Satisfying a real-time system (RTS) timing constraints is a serious deal for the prevention or the decreasing of the human and economic possible problems. In this vein, multiprocessor RTS scheduling is increasingly difficult, especially since it became more complex and dynamic. In this context, scheduling correction turns out to be very necessary for a better schedulability. In fact once done at an early stage of the scheduling cycle, it can effectively reduce the potential temporal faults. It helps then avoiding the risk of a very expensive complete reiteration of the scheduling cycle, thus reduce the temporal cost.

The present paper focuses on providing a scheduling correction solution that may be integrated into the scheduling analysis. The proposed correction method is based on rectifying the partitioning if the RTS is detected non-schedulable. This method is based on the migration of some tasks from the non-schedulable overloaded partitions toward the not loaded ones.


Real time systems Scheduling analysis Scheduling correction Tasks migration 


  1. 1.
    Agrawal, S., Gupta, R.K.: Data-flow assisted behavioral partitioning for embedded systems. In: Proceedings of the 34th Annual Design Automation Conference, pp. 709–712. ACM (1997)Google Scholar
  2. 2.
    Alur, R., Henzinger, T.A.: Real-time logics: complexity and expressiveness. Inf. Comput. 104(1), 35–77 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Åsberg, M., Nolte, T., Kato, S.: Towards partitioned hierarchical real-time scheduling on multi-core processors. ACM SIGBED Rev. 11(2), 13–18 (2014)CrossRefGoogle Scholar
  4. 4.
    Baker, T.P.: An analysis of EDF schedulability on amultiprocessor. IEEE Trans. Parallel Distrib. Syst. 16(8), 760–768 (2005). CrossRefGoogle Scholar
  5. 5.
    Baker, T.P.: Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hard real time. Citeseer (2005)Google Scholar
  6. 6.
    Baker, T.P.: A comparison of global and partitioned EDF schedulability tests for multiprocessors. Technical report, in International Conference on Real-Time and Network Systems (2005)Google Scholar
  7. 7.
    Baruah, S.: Techniques for multiprocessor global schedulability analysis. In: 28th IEEE International Real-Time Systems Symposium, RTSS 2007, pp. 119–128. IEEE (2007)Google Scholar
  8. 8.
    Bertogna, M., Baruah, S.: Tests for global EDF schedulability analysis. J. Syst. Architect. 57(5), 487–497 (2011)CrossRefGoogle Scholar
  9. 9.
    Bertozzi, S., Acquaviva, A., Bertozzi, D., Poggiali, A.: Supporting task migration in multi-processor systems-on-chip: a feasibility study. In: Proceedings of the Conference on Design, Automation and Test in Europe: Proceedings, European Design and Automation Association, pp. 15–20 (2006)Google Scholar
  10. 10.
    Burchard, A., Liebeherr, J., Oh, Y., Son, S.H.: New strategies for assigning real-time tasks to multiprocessor systems. IEEE Trans. Comput. 44(12), 1429–1442 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Chehida, K.B.: Méthodologie de partitionnement logiciel/matériel pour plateformes reconfigurables dynamiquement. Ph.D. thesis, Université Nice Sophia Antipolis (2004)Google Scholar
  12. 12.
    Chéramy, M., Déplanche, A.M., Hladik, P.E.: Ordonnancement temps réel: des politiques monoprocesseurs aux politiques multiprocesseurs. HALUNIV-NANTESFR (2012)Google Scholar
  13. 13.
    Chéramy, M., Hladik, P.E., Déplanche, A.M.: Algorithmes pour lordonnancement temps réel multiprocesseur. J. Européen des Systèmes Automatisés (JESA) 48(7–8), 613–639 (2015)Google Scholar
  14. 14.
    Davis, R.I., Burns, A.: A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv. (CSUR) 43(4), 35 (2011)CrossRefzbMATHGoogle Scholar
  15. 15.
    De Rauglaudre, D.: Vérification formelle de conditions d’ordonnancabilité de tâches temps réel périodiques strictes. In: JFLA-Journées Francophones des Langages Applicatifs-2012 (2012)Google Scholar
  16. 16.
    Dorin, F., Yomsi, P.M., Goossens, J., Richard, P.: Semi-partitioned hard real-time scheduling with restricted migrations upon identical multiprocessor platforms. arXiv preprint arXiv:10062637 (2010)
  17. 17.
    Funk, S., Baruah, S.: Restricting EDF migration on uniform multiprocessors. In: Proceedings of the 12th International Conference on Real-Time Systems (2004)Google Scholar
  18. 18.
    Gen, M., Cheng, R.: Genetic Algorithms and Engineering Optimization, vol. 7. Wiley, Hoboken (2000)Google Scholar
  19. 19.
    Goossens, J., Richard, P.: Ordonnancement temps réel multiprocesseur. In: État de l’art–ETR 2013 (2013)Google Scholar
  20. 20.
    Gracioli, G., Fröhlich, A.A., Pellizzoni, R., Fischmeister, S.: Implementation and evaluation of global and partitioned scheduling in a real-time OS. Real-Time Syst. 49(6), 669–714 (2013)CrossRefzbMATHGoogle Scholar
  21. 21.
    Houbad, Y., Souier, M., Hassam, A., Sari, Z.: Ordonnancement en temps réel dun jobshop par métaheuristique hybride: étude comparative. dspaceuniv-tlemcendz (2011)Google Scholar
  22. 22.
    Johnson, D.S.: Fast algorithms for bin packing. J. Comput. Syst. Sci. 8(3), 272–314 (1974)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Karamti, W., Mahfoudhi, A.: Scheduling analysis based on model checking for multiprocessor real-time systems. J. Supercomput. 68(3), 1604–1629 (2014)CrossRefGoogle Scholar
  24. 24.
    Khardon, R., Pinter, S.S.: Partitioning and scheduling to counteract overhead. Parallel Comput. 22(4), 555–593 (1996)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Korf, R.E.: A new algorithm for optimal bin packing. In: AAAI/IAAI, pp. 731–736 (2002)Google Scholar
  26. 26.
    Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM (JACM) 20(1), 46–61 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Oper. Res. 48(2), 256–267 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    Ndoye, F.: Ordonnancement temps réel préemptif multiprocesseur avec prise en compte du coût du système d’exploitation. Ph.D. thesis, Université Paris Sud-Paris XI (2014)Google Scholar
  29. 29.
    Niemann, R., Marwedel, P.: Hardware/software partitioning using integer programming. In: Proceedings of the 1996 European conference on Design and Test, p. 473. IEEE Computer Society (1996)Google Scholar
  30. 30.
    Shekhar, M., Ramaprasad, H., Sarkar, A., Mueller, F.: Architecture aware semi partitioned real-time scheduling on multicore platforms. Real-Time Syst. 51(3), 274–313 (2015)CrossRefzbMATHGoogle Scholar
  31. 31.
    Silva, F.A., Maciel, P., Matos, R.: SmartRank: a smart scheduling tool for mobile cloud computing. J. Supercomput. 71(8), 2985–3008 (2015)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Faculty of Economics and ManagementUniversity of SfaxSfaxTunisia
  2. 2.Higher Institute of Computer Science and MathematicsUniversity of MonastirMonastirTunisia
  3. 3.College of Computers and Information TechnologyTaif UniversityTa’ifSaudi Arabia

Personalised recommendations