Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr.:
Year:
Volume:
Issue:
Page:
Find






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


Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya, 2018, Volume 14, Issue 1, Pages 40–50
DOI: https://doi.org/10.21638/11701/spbu10.2018.105
(Mi vspui356)
 

Computer science

Stationary cycles in a deterministic service system

V. M. Bure, A. N. Elfimov, V. V. Karelin

St. Petersburg State University, 7–9, Universitetskaya nab., St. Petersburg, 199034, Russian Federation
References:
Abstract: The article describes a deterministic service system, which receives requests from three queues. Characteristics of the service system such as intensity and rate of service request are stable and do not depend on time. The paper introduces definitions of the stationary mode and the cycle of service for requirements from queues. The main aim this article is to find necessary and sufficient conditions imposed on the duration of the service cycles, under which the existence of a stationary mode of operation of the service system is obtained and guaranteed. When a stationary service mode is implemented, the possibility of infinite accumulation of requests is excluded, while the order of servicing queues is set in advance and does not change in the future. Within the framework of the mathematical model of the deterministic service system, some technological limitations have been introduced. The fulfillment of these limitations is necessary for the construction of an adequate model. In particular, it is assumed that the service of the requirement can't be interrupted. The proof of the main result of the item is based on the solution of inequalities obtained by considering the mathematical model of the functioning of the service system. In the proof was given a geometric interpretation of the set of admissible (providing a stationary mode) durations of continuous service for requests received from the queues. Refs 12. Figs 2.
Keywords: deterministic system service, service cycle, steady state.
Funding agency Grant number
Saint Petersburg State University 9.38.205.2014
Received: October 15, 2017
Accepted: January 11, 2018
Bibliographic databases:
Document Type: Article
UDC: 519.6
Language: Russian
Citation: V. M. Bure, A. N. Elfimov, V. V. Karelin, “Stationary cycles in a deterministic service system”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 14:1 (2018), 40–50
Citation in format AMSBIB
\Bibitem{BurElfKar18}
\by V.~M.~Bure, A.~N.~Elfimov, V.~V.~Karelin
\paper Stationary cycles in a deterministic service system
\jour Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr.
\yr 2018
\vol 14
\issue 1
\pages 40--50
\mathnet{http://mi.mathnet.ru/vspui356}
\crossref{https://doi.org/10.21638/11701/spbu10.2018.105}
\elib{https://elibrary.ru/item.asp?id=32786043}
Linking options:
  • https://www.mathnet.ru/eng/vspui356
  • https://www.mathnet.ru/eng/vspui/v14/i1/p40
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Вестник Санкт-Петербургского университета. Серия 10. Прикладная математика. Информатика. Процессы управления
    Statistics & downloads:
    Abstract page:140
    Full-text PDF :13
    References:7
    First page:3
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024