Experimental Analysis of the Tardiness of Parallel Tasks in Soft Real-Time Systems

  • Manar QamhiehEmail author
  • Serge Midonnet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8828)


A parallel application is defined as the application that can be executed on multiple processors simultaneously. In software, parallelism is a useful programming technique to take advantage of the hardware advancement in processors manufacturing nowadays. In real-time systems, where tasks have to respect certain timing constraints during execution, a single task has a shorter response time when executed in parallel than the sequential execution. However, the same cannot be trivially applied to a set of parallel tasks (taskset) sharing the same processing platform, and there is a negative intuition regarding parallelism in real-time systems. In this work, we are interested in analyzing this statement and providing an experimental analysis regarding the effect of parallelism soft on real-time systems. By performing an extensive simulation of the scheduling process of parallel taskset on multiprocessor systems using a known scheduling algorithm called the global Earliest-Deadline First (gEDF), we aim at providing an indication about the effects (positive or negative) of parallelism in real-time scheduling.


Parallelism Stretching techniques Real-time systems Soft real-time systems Scheduling simulation Global earliest deadline first 


  1. 1.
    Mixed criticality systems. European Commission Workshop on Mixed Criticality Systems, Brussels, Belgium, February 2012Google Scholar
  2. 2.
  3. 3.
  4. 4.
    Davis, R.I., Burns, A.: A survey of hard real-time scheduling algorithms and schedulability analysis techniques for multiprocessor systems. ACM Comput. Curveys 43, 1–44 (2011)CrossRefGoogle Scholar
  5. 5.
    Saifullah, A., Ferry, D., Agrawal, K., Lu, C., Gill, C.: Real-time scheduling of parallel tasks under a general DAG model. Technical report, Washington University in St Louis (2012)Google Scholar
  6. 6.
    Baruah, S.K., Bonifaciy, V., Marchetti-Spaccamela, A., Stougie, L., Wiese, A.: A generalized parallel task model for recurrent real-time processes. In: Proceedings of the 33rd IEEE Real-Time Systems Symposium (RTSS), December 2012, pp. 63–72 (2012)Google Scholar
  7. 7.
    Lakshmanan, K., Kato, S., (Raj) Rajkumar, R.: Scheduling parallel real-time tasks on multi-core processors. In: Proceedings of the 31st IEEE Real-Time Systems Symposium (RTSS), pp. 259–268. IEEE Computer Society (2010)Google Scholar
  8. 8.
    Ha, R., Liu, J.: Validating timing constraints in multiprocessor and distributed real-time systems. In: 14th International Conference on Distributed Computing Systems, pp. 162–171. IEEE Computer Society Press (1994)Google Scholar
  9. 9.
    Dhall, S.K., Liu, C.L.: On a real-time scheduling problem. Oper. Res. 26(1), 127–140 (1978)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation (extended abstract). In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, ser. STOC 1997, pp. 140–149 (1997)Google Scholar
  11. 11.
    Valente, P., Lipari, G.: An upper bound to the lateness of soft real-time tasks scheduled by edf on multiprocessors. In: 26th IEEE International Real-Time Systems Symposium, 2005, RTSS 2005, pp. 10–320 (2005)Google Scholar
  12. 12.
    Valente, P., Lipari, G.: An upper bound to the lateness of soft real-time tasks scheduled by EDF on multiprocessors. Technical report RETIS TR05-01, Scuola Superiore S.Anna (2005)Google Scholar
  13. 13.
    Devi, U.: Soft real-time scheduling on multiprocessors. Ph.D. dissertation, University of North Carolina at Chapel Hill, Chapel Hill, Sweden (2006)Google Scholar
  14. 14.
    YaRTISS simulation tool.
  15. 15.
    Davis, R., Burns, A.: Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. Real-Time Syst. 47(1), 1–40 (2011)CrossRefzbMATHGoogle Scholar
  16. 16.
    Goossens, J., Macq, C.: Limitation of the hyper-period in real-time periodic task set generation. In: Proceedings of the 9th International Conference on Real-Time Systems (RTS), March 2001, pp. 133–148 (2001)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Université Paris-EstChamps-sur-MarneFrance

Personalised recommendations