RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Model. Anal. Inform. Sist., 2016, Volume 23, Number 6, Pages 673–687 (Mi mais532)  

Analysis of real-time applications feasibility through simulation

S. N. Baranovab, V. V. Nikiforova

a SPIIRAS, 14 liniya 39, St.Petersburg 199178, Russia
b ITMO University, 49 Kronverksky pr., St.Petersburg 197101, Russia

Abstract: 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.

Keywords: simulation, real-time, application density, application feasibility.

Funding Agency Grant Number
Ministry of Education and Science of the Russian Federation 074-U01
This work was partially financially supported by Government of the Russian Federation, Grant 074-U01.


DOI: https://doi.org/10.18255/1818-1015-2016-6-673-687

Full text: PDF file (640 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 004.04
Received: 15.03.2016

Citation: S. N. Baranov, V. V. Nikiforov, “Analysis of real-time applications feasibility through simulation”, Model. Anal. Inform. Sist., 23:6 (2016), 673–687

Citation in format AMSBIB
\Bibitem{BarNik16}
\by S.~N.~Baranov, V.~V.~Nikiforov
\paper Analysis of real-time applications feasibility through simulation
\jour Model. Anal. Inform. Sist.
\yr 2016
\vol 23
\issue 6
\pages 673--687
\mathnet{http://mi.mathnet.ru/mais532}
\crossref{https://doi.org/10.18255/1818-1015-2016-6-673-687}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3596153}
\elib{http://elibrary.ru/item.asp?id=27517415}


Linking options:
  • http://mi.mathnet.ru/eng/mais532
  • http://mi.mathnet.ru/eng/mais/v23/i6/p673

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Моделирование и анализ информационных систем
    Number of views:
    This page:126
    Full text:50
    References:24

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020