Geodesic
Analysis of real-time applications feasibility through simulation
Modelirovanie i analiz informacionnyh sistem, Tome 23 (2016) no. 6, pp. 673-687.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Mots-clés : simulation
Keywords: real-time, application density, application feasibility. 
@article{MAIS_2016_23_6_a0,
     author = {S. N. Baranov and V. V. Nikiforov},
     title = {Analysis of real-time applications feasibility through simulation},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {673--687},
     publisher = {mathdoc},
     volume = {23},
     number = {6},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2016_23_6_a0/}
}
TY  - JOUR
AU  - S. N. Baranov
AU  - V. V. Nikiforov
TI  - Analysis of real-time applications feasibility through simulation
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2016
SP  - 673
EP  - 687
VL  - 23
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2016_23_6_a0/
LA  - ru
ID  - MAIS_2016_23_6_a0
ER  - 
%0 Journal Article
%A S. N. Baranov
%A V. V. Nikiforov
%T Analysis of real-time applications feasibility through simulation
%J Modelirovanie i analiz informacionnyh sistem
%D 2016
%P 673-687
%V 23
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2016_23_6_a0/
%G ru
%F MAIS_2016_23_6_a0
S. N. Baranov; V. V. Nikiforov. Analysis of real-time applications feasibility through simulation. Modelirovanie i analiz informacionnyh sistem, Tome 23 (2016) no. 6, pp. 673-687. http://geodesic.mathdoc.fr/item/MAIS_2016_23_6_a0/

[1] Liu C., Layland J., “Scheduling Algorithms for Multiprocessing in a Hard Real-Time Environment”, Journal of the ACM, 20:1 (1973), 46–61 | DOI | MR | Zbl

[2] Andersson B., Baruah S., Jonsson J., “Static-Priority Scheduling on Multiprocessors”, Proc. 22nd IEEE Real-Time Systems Symposium, 2001, 193–202

[3] Laplante P. A., Real-Time Systems Design and Analysis, John Wiley Sons, Inc., 2004

[4] Baker T., “Multiprocessors EDF and Deadline Monotonic Schedulability Analysis”, Proc. 24th IEEE Real-Time Systems Symposium, 2003, 120–129 | DOI

[5] Andersson B., “Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%”, Proc. 12th International Conference on Principles of Distributed Systems, 2008, 73–88

[6] Baranov S. N., “Real-Time Multi-Task Simulation in Forth”, Proc. 18th Conf. FRUCT Association, 2016, 21–26

[7] Baranov S. N., Nikiforov V. V., “Application Density and Feasibility Checking in Real-Time Systems”, System Informatics, 2016, no. 7, 1–9

[8] Baranov S. N., Nikiforov V. V., “Density of Multi-Task Real-Time Applications”, Proc. 17th Conf. FRUCT Association, 2015, 9–15

[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

[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

[11] Forth 200x, , 2016 http://www.forth200x.org/forth200x.html