Automatic Control and Computer Sciences

, Volume 51, Issue 7, pp 479–488 | Cite as

Analysis of Real-Time Applications Feasibility through Simulation



An approach to estimate feasibility of a real-time multi-task application with various combinations of the scheduling mode and the protocol of access to shared informational resources when run on a multi-core platform is described. The application structure is specified through a simple formalized profile consisting of segments of three types and specifying access to informational resources shared among application tasks, the amount of the required computing resource being estimated for each segment. The approach is based on the notion of application density introduced by the authors which characterizes the use of computational resource by this application and is derived from estimation of the application feasibility for various values of processor performance and the number of its cores in case of a multi-core platform. The overall structure of a simulation tool for estimation of the task response time (and therefore, application feasibility) is described, which provides more exact data compared to the known analytical methods where they are applicable. Two dissimilar implementations of this tool were developed and run on a number of benchmarks, including Liu-Layland configurations specified in the described formalism for application structure; the results in form of charts are presented along with their analysis and interpretation. The suggested approach allows to indentify an optimal combination of the scheduling mode and access protocol for the given multi-task application structure.


simulation real-time application density application feasibility 


  1. 1.
    Liu, C. and Layland, J., Scheduling algorithms for multiprocessing in a hard real-time environment, J. ACM, 1973, vol. 20, no. 1, pp. 46–61.CrossRefMATHGoogle Scholar
  2. 2.
    Andersson, B., Baruah, S., and Jonsson, J., Static-priority scheduling on multiprocessors, Proc. 22nd IEEE Real-Time Systems Symposium, 2001, pp. 193–202.Google Scholar
  3. 3.
    Laplante, P.A., Real-Time Systems Design and Analysis, John Wiley & Sons, Inc., 2004.CrossRefGoogle Scholar
  4. 4.
    Baker, T., Multiprocessors EDF and Deadline Monotonic Schedulability Analysis, Proc. 24th IEEE Real-Time Systems Symposium, 2003, pp. 120–129.Google Scholar
  5. 5.
    Andersson, B., Global static-priority preemptive multiprocessor scheduling with utilization bound 38%", Proc. 12th International Conference on Principles of Distributed Systems, 2008, pp. 73–88.Google Scholar
  6. 6.
    Baranov, S.N., Real-time multi-task simulation in forth, Proc. 18th Conf. FRUCT Association, 2016, pp. 21–26.Google Scholar
  7. 7.
    Baranov, S.N. and Nikiforov, V.V., Application density and feasibility checking in real-time systems, Syst. Inf., 2016, no. 7, pp. 1–9. Scholar
  8. 8.
    Baranov, S.N. and Nikiforov, V.V., Density of multi-task real-time applications, Proc. 17th Conf. FRUCT Association, 2015, pp. 9–15.Google Scholar
  9. 9.
    Nikiforov, V.V., Program OEKPP for estimating the efficiency of software application configurations, Certificate of Computer Program Registration Number 2016618872 of 9 August 2016 (RU), 2016. Scholar
  10. 10.
    Baranov, S.N., Program RTMT for simulation of multi-task application behavior, Certificate of Computer Program Registration Number 2016613095 of 16 March 2016 (RU), 2016. Scholar
  11. 11.
    Forth 200x, 2016. Scholar
  12. 12.
    Sha, L., Rajkumar, R., and Lehoczky, J.P., Priority inheritance protocols: An approach to real-time synchronization, IEEE Trans. Comput., 1990, vol. 20, no. 9, pp. 1175–1185.MathSciNetCrossRefGoogle Scholar

Copyright information

© Allerton Press, Inc. 2017

Authors and Affiliations

  1. 1.SPIIRAS, ITMO UniversitySt. PetersburgRussia
  2. 2.SPIIRASSt. PetersburgRussia

Personalised recommendations