45 research outputs found
ΠΠ±Π·ΠΎΡ ΡΠΈΡΡΠ΅ΠΌ ΠΏΠ°ΡΠ°Π»Π»Π΅Π»ΡΠ½ΠΎΠΉ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ Π·Π°ΡΠ²ΠΎΠΊ. Π§Π°ΡΡΡ II
This paper is a continuation of the survey of the βfork-joinβ queuing systems (in the westernclassiο¬cation) or the systems with splitting of queries. Interest in such systems is explainedby a wide range of problems that can be solved with their help, since in fact it is a matter ofparallel processing of data and their applications. For example, this may concern the analysis ofdisk arrays, cloud computing, high-performance services and even the process of picking ordersin a warehouse. In the ο¬rst part of the survey, the main features of the described model (andrelated systems) and its construction were introduced. Also the detailed description of theapproach to obtaining an accurate expression of the average response time in the case of twodevices was presented as well as several methods of approximate analysis of this characteristic(the case when the number of devices is more than two). This part of the survey is devotedto the description of other existing methods for approximating the average response time. Inparticular, the approaches of the approximate analysis of the response time are as follows: thematrix-geometric method, the analysis with the help of order statistics for various types ofdistribution of the service time of subqueries.ΠΠ°Π½Π½Π°Ρ ΡΠ°Π±ΠΎΡΠ° ΡΠ²Π»ΡΠ΅ΡΡΡ ΠΏΡΠΎΠ΄ΠΎΠ»ΠΆΠ΅Π½ΠΈΠ΅ΠΌ ΠΎΠ±Π·ΠΎΡΠ° ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΡΠΈΡΡΠ΅ΠΌΡ ΠΌΠ°ΡΡΠΎΠ²ΠΎΠ³ΠΎΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ Π²ΠΈΠ΄Π° Β«fork-joinΒ» (Π² Π·Π°ΠΏΠ°Π΄Π½ΠΎΠΉ ΠΊΠ»Π°ΡΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ) ΠΈΠ»ΠΈ ΡΠΈΡΡΠ΅ΠΌΡ Ρ ΡΠ°ΡΡΠ΅ΠΏΠ»Π΅Π½ΠΈΠ΅ΠΌΠ·Π°ΠΏΡΠΎΡΠΎΠ². ΠΠ½ΡΠ΅ΡΠ΅Ρ ΠΊ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΠΌΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΠ΅ ΠΎΠ±ΡΡΡΠ½ΡΠ΅ΡΡΡ ΡΠΈΡΠΎΠΊΠΈΠΌ ΡΠΏΠ΅ΠΊΡΡΠΎΠΌ Π·Π°Π΄Π°Ρ, ΠΊΠΎΡΠΎΡΡΠ΅ ΠΌΠΎΠ³ΡΡ Π±ΡΡΡ ΡΠ΅ΡΠ΅Π½Ρ Ρ Π΅Ρ ΠΏΠΎΠΌΠΎΡΡΡ, ΠΏΠΎΡΠΊΠΎΠ»ΡΠΊΡ ΡΠ°ΠΊΡΠΈΡΠ΅ΡΠΊΠΈ ΡΠ΅ΡΡ ΠΈΠ΄ΡΡ ΠΎ ΠΏΠ°ΡΠ°Π»Π»Π΅Π»ΡΠ½ΠΎΠΉΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠ΅ Π΄Π°Π½Π½ΡΡ
ΠΈ ΠΈΡ
ΠΏΡΠΈΠ»ΠΎΠΆΠ΅Π½ΠΈΡΡ
. Π ΠΏΡΠΈΠΌΠ΅ΡΡ, ΡΡΠΎ ΠΌΠΎΠΆΠ΅Ρ ΠΊΠ°ΡΠ°ΡΡΡΡ Π°Π½Π°Π»ΠΈΠ·Π° ΡΠ°Π±ΠΎΡΡ Π΄ΠΈΡΠΊΠΎΠ²ΡΡ
ΠΌΠ°ΡΡΠΈΠ²ΠΎΠ², ΠΎΠ±Π»Π°ΡΠ½ΡΡ
Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΠΉ, Π²ΡΡΠΎΠΊΠΎΠΏΡΠΎΠΈΠ·Π²ΠΎΠ΄ΠΈΡΠ΅Π»ΡΠ½ΡΡ
ΡΠ΅ΡΠ²ΠΈΡΠΎΠ² ΠΈ Π΄Π°ΠΆΠ΅ ΠΏΡΠΎΡΠ΅ΡΡΠ°ΠΊΠΎΠΌΠΏΠ»Π΅ΠΊΡΠ°ΡΠΈΠΈ Π·Π°ΠΊΠ°Π·ΠΎΠ² Π½Π° ΡΠΊΠ»Π°Π΄Π΅. ΠΡΠ»ΠΈ Π² ΠΏΠ΅ΡΠ²ΠΎΠΉ ΡΠ°ΡΡΠΈ ΠΎΠ±Π·ΠΎΡΠ° Π±ΡΠ»ΠΈ ΠΎΠΏΠΈΡΠ°Π½Ρ ΠΎΡΠΎΠ±Π΅Π½Π½ΠΎΡΡΠΈΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ Π΄Π°Π½Π½ΠΎΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈ ΠΈ ΡΠΎΠ΄ΡΡΠ²Π΅Π½Π½ΡΡ
Π΅ΠΉ ΡΠΈΡΡΠ΅ΠΌ, Π° ΡΠ°ΠΊΠΆΠ΅ ΠΏΡΠΈΠ²Π΅Π΄Π΅Π½ΠΎ ΠΏΠΎΠ΄ΡΠΎΠ±Π½ΠΎΠ΅ ΠΎΠΏΠΈΡΠ°Π½ΠΈΠ΅ ΠΏΠΎΠ΄Ρ
ΠΎΠ΄Π° ΠΊ ΠΏΠΎΠ»ΡΡΠ΅Π½ΠΈΡ ΡΠΎΡΠ½ΠΎΠ³ΠΎ Π²ΡΡΠ°ΠΆΠ΅Π½ΠΈΡ ΡΡΠ΅Π΄Π½Π΅Π³ΠΎ Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ ΠΎΡΠΊΠ»ΠΈΠΊΠ° Π² ΡΠ»ΡΡΠ°Π΅ Π΄Π²ΡΡ
ΠΏΡΠΈΠ±ΠΎΡΠΎΠ² ΠΈ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ΠΎ Π½Π΅ΡΠΊΠΎΠ»ΡΠΊΠΎ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΏΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π° Π΄Π°Π½Π½ΠΎΠΉ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ Π² ΡΠ»ΡΡΠ°Π΅, ΠΊΠΎΠ³Π΄Π° ΡΠΈΡΠ»ΠΎ ΠΏΡΠΈΠ±ΠΎΡΠΎΠ² Π±ΠΎΠ»ΡΡΠ΅ Π΄Π²ΡΡ
, ΡΠΎ Π²ΠΎ Π²ΡΠΎΡΠΎΠΉ ΡΠ°ΡΡΠΈ ΠΎΠ±Π·ΠΎΡΠ° ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ΠΎΠΎΠΏΠΈΡΠ°Π½ΠΈΠ΅ Π΄ΡΡΠ³ΠΈΡ
ΡΡΡΠ΅ΡΡΠ²ΡΡΡΠΈΡ
ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² Π°ΠΏΠΏΡΠΎΠΊΡΠΈΠΌΠ°ΡΠΈΠΈ ΡΡΠ΅Π΄Π½Π΅Π³ΠΎ Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ ΠΎΡΠΊΠ»ΠΈΠΊΠ°. Π ΡΠ°ΡΡΠ½ΠΎΡΡΠΈ, ΠΊ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΠΌΡΠΌ ΠΏΠΎΠ΄Ρ
ΠΎΠ΄Π°ΠΌ ΠΏΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π° Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ ΠΎΡΠΊΠ»ΠΈΠΊΠ° ΠΎΡΠ½ΠΎΡΡΡΡΡ:ΠΌΠ°ΡΡΠΈΡΠ½ΠΎ-Π³Π΅ΠΎΠΌΠ΅ΡΡΠΈΡΠ΅ΡΠΊΠΈΠΉ ΠΌΠ΅ΡΠΎΠ΄, Π°Π½Π°Π»ΠΈΠ· Ρ ΠΏΠΎΠΌΠΎΡΡΡ ΠΏΠΎΡΡΠ΄ΠΊΠΎΠ²ΡΡ
ΡΡΠ°ΡΠΈΡΡΠΈΠΊ Π΄Π»Ρ ΡΠ°Π·Π»ΠΈΡΠ½ΡΡ
ΡΠΈΠΏΠΎΠ² ΡΠ°ΡΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΡ Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ ΠΏΡΠ΅Π±ΡΠ²Π°Π½ΠΈΡ ΠΏΠΎΠ΄Π·Π°ΠΏΡΠΎΡΠΎΠ²
Dark Energy Fluid with Time-Dependent, Inhomogeneous Equation of State
The four-dimensional Friedman flat universe, filled with an ideal fluid with
a linear (oscillating) inhomogeneous equation of state (EoS) depending on time,
is studied. The equations of motion are solved. It is shown that in some cases
there appears a quasi-periodic universe, which repeats the cycles of
phantom-type space acceleration. The appearance of future singularities
resulting from various choices for the input parameters is discussed.Comment: 9 pages pdf, 4 figures. To appear in European Physical Journal
A FRW Dark Fluid with a Non-Linear Inhomogeneous Equation of State
A dark Friedman-Robertson-Walker fluid governed by a non-linear inhomogeneous
equation of state is considered which can be viewed as a conveniently simple
paradigm for a whole class of models which exhibit phase transitions from a
non-phantom towards a phantom era (superacceleration transition). From another
side, such dark fluid models may describe also quintessence-like cosmic
acceleration. Thermodynamical considerations for the processes involved, which
are of great importance in the characterization of the global evolution of the
corresponding universe, are given too. Connecting the proposed equation of
state with an anisotropic Kasner universe with viscosity, we are led to the
plausible conjecture of a dark fluid origin of the anisotropies in the early
universe.Comment: 11 pages pdf, 2 figures; to appear in Eur. Phys. J.
ΠΠ½Π°Π»ΠΈΠ· ΡΠΈΡΡΠ΅ΠΌΡ ΠΌΠ°ΡΡΠΎΠ²ΠΎΠ³ΠΎ ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ Ρ Π΄Π²ΡΠΌΡ Π²Ρ ΠΎΠ΄ΡΡΠΈΠΌΠΈ ΠΏΠΎΡΠΎΠΊΠ°ΠΌΠΈ ΠΈ Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΠ½ΡΠΌ ΡΠ±ΡΠΎΡΠΎΠΌ
The queueing system with two independent ο¬ows of requests with diο¬erent types of priorities is considered. The incoming ο¬ows are Poisson ο¬ows with diο¬erent (non equal) rates. The service times of each type requests are independent and exponentially distributed. The priority requests at the end of its service can drop non-priority ones with probability q (renovation probability) or just leaves the system with probability p = 1 - q. For general case the two-dimensional Markov process is introduced and the system of equilibrium equations for steady-state probability distribution is presented. For special case, when drop probability q is equal to one, some probabilistic characteristics as the steady-state probability distribution of priority requests, the probability of idle period are obtained. Also the analytical expressions for some characteristics of non-priority requests, such as probability of being dropped (or serviced), waiting time distribution for non-priority requests (in terms of Laplace-Stieltjes transformation and generating function) and mean waiting time, are obtained.Π Π°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΡΡΡ ΠΎΠ΄Π½ΠΎΠ»ΠΈΠ½Π΅ΠΉΠ½Π°Ρ ΡΠΈΡΡΠ΅ΠΌΠ° ΠΌΠ°ΡΡΠΎΠ²ΠΎΠ³ΠΎ ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ Ρ Π½Π°ΠΊΠΎΠΏΠΈΡΠ΅Π»Π΅ΠΌ Π½Π΅ΠΎΠ³ΡΠ°Π½ΠΈΡΠ΅Π½Π½ΠΎΠΉ ΡΠΌΠΊΠΎΡΡΠΈ, Π² ΠΊΠΎΡΠΎΡΡΡ ΠΏΠΎΡΡΡΠΏΠ°ΡΡ Π΄Π²Π° Π½Π΅Π·Π°Π²ΠΈΡΠΈΠΌΡΡ
ΠΏΡΠ°ΡΡΠΎΠ½ΠΎΠ²ΡΠΊΠΈΡ
ΠΏΠΎΡΠΎΠΊΠ° Π·Π°ΡΠ²ΠΎΠΊ Ρ ΡΠ°Π·Π»ΠΈΡΠ½ΡΠΌΠΈ ΠΈΠ½ΡΠ΅Π½ΡΠΈΠ²Π½ΠΎΡΡΡΠΌΠΈ ΠΈ ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ°ΠΌΠΈ. ΠΠ°ΡΠ²ΠΊΠ° ΠΏΠ΅ΡΠ²ΠΎΠ³ΠΎ ΡΠΈΠΏΠ° (ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ½Π°Ρ), Π½Π°Ρ
ΠΎΠ΄ΡΡΠ°ΡΡΡ Π½Π° ΠΏΡΠΈΠ±ΠΎΡΠ΅, ΠΌΠΎΠΆΠ΅Ρ Π² ΠΌΠΎΠΌΠ΅Π½Ρ ΠΎΠΊΠΎΠ½ΡΠ°Π½ΠΈΡ ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ Π»ΠΈΠ±ΠΎ ΠΏΠΎΠΊΠΈΠ½ΡΡΡ ΡΠΈΡΡΠ΅ΠΌΡ Ρ Π½Π΅ΠΊΠΎΡΠΎΡΠΎΠΉ Π½Π΅Π½ΡΠ»Π΅Π²ΠΎΠΉ Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΡΡ, Π»ΠΈΠ±ΠΎ Ρ Π΄ΠΎΠΏΠΎΠ»Π½ΠΈΡΠ΅Π»ΡΠ½ΠΎΠΉ Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΡΡ ΡΠ±ΡΠΎΡΠΈΡΡ Π²ΡΠ΅ Π·Π°ΡΠ²ΠΊΠΈ Π²ΡΠΎΡΠΎΠ³ΠΎ ΡΠΈΠΏΠ° (Π½Π΅ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ½ΡΠ΅ Π·Π°ΡΠ²ΠΊΠΈ) ΠΈΠ· Π½Π°ΠΊΠΎΠΏΠΈΡΠ΅Π»Ρ ΠΈ ΠΏΠΎΠΊΠΈΠ½ΡΡΡ ΡΠΈΡΡΠ΅ΠΌΡ. ΠΠ»ΠΈΡΠ΅Π»ΡΠ½ΠΎΡΡΠΈ ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ Π·Π°ΡΠ²ΠΎΠΊ ΠΎΠ±ΠΎΠΈΡ
ΡΠΈΠΏΠΎΠ² ΠΈΠΌΠ΅ΡΡ ΡΠΊΡΠΏΠΎΠ½Π΅Π½ΡΠΈΠ°Π»ΡΠ½ΡΠ΅ ΡΠ°ΡΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΡ Ρ ΡΠ°Π·Π»ΠΈΡΠ½ΡΠΌΠΈ Π·Π½Π°ΡΠ΅Π½ΠΈΡΠΌΠΈ ΠΈΠ½ΡΠ΅Π½ΡΠΈΠ²Π½ΠΎΡΡΠ΅ΠΉ ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ. ΠΠ»Ρ ΠΎΠ±ΡΠ΅Π³ΠΎ ΡΠ»ΡΡΠ°Ρ ΠΏΠΎΡΡΡΠΎΠ΅Π½ Π΄Π²ΡΠΌΠ΅ΡΠ½ΡΠΉ ΠΌΠ°ΡΠΊΠΎΠ²ΡΠΊΠΈΠΉ ΠΏΡΠΎΡΠ΅ΡΡ, ΠΏΠΎΠ»ΡΡΠ΅Π½Π° ΡΠΈΡΡΠ΅ΠΌΠ° ΡΡΠ°Π²Π½Π΅Π½ΠΈΠΉ ΡΠ°Π²Π½ΠΎΠ²Π΅ΡΠΈΡ Π΄Π»Ρ ΡΡΠ°ΡΠΈΠΎΠ½Π°ΡΠ½ΠΎΠ³ΠΎ ΡΠ°ΡΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΡ ΡΠΈΡΠ»Π° Π·Π°ΡΠ²ΠΎΠΊ ΠΎΠ±ΠΎΠΈΡ
ΡΠΈΠΏΠΎΠ² Π² ΡΠΈΡΡΠ΅ΠΌΠ΅. ΠΠ»Ρ ΡΠ°ΡΡΠ½ΠΎΠ³ΠΎ ΡΠ»ΡΡΠ°Ρ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΠΌΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΡ (ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ½ΡΠ΅ Π·Π°ΡΠ²ΠΊΠΈ ΡΠ±ΡΠ°ΡΡΠ²Π°ΡΡ Π½Π΅ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ½ΡΠ΅ Ρ Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΡΡ, ΡΠ°Π²Π½ΠΎΠΉ Π΅Π΄ΠΈΠ½ΠΈΡΠ΅) Π² ΡΠ²Π½ΠΎΠΌ Π²ΠΈΠ΄Π΅ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ΠΎ ΡΡΠ°ΡΠΈΠΎΠ½Π°ΡΠ½ΠΎΠ΅ ΡΠ°ΡΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΠ΅ ΡΠΈΡΠ»Π° ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ½ΡΡ
Π·Π°ΡΠ²ΠΎΠΊ Π² ΡΠΈΡΡΠ΅ΠΌΠ΅, Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΡ ΠΏΡΠΎΡΡΠΎΡ ΡΠΈΡΡΠ΅ΠΌΡ. Π’Π°ΠΊΠΆΠ΅ ΠΏΠΎΠ»ΡΡΠ΅Π½ΠΎ Π²ΡΡΠ°ΠΆΠ΅Π½ΠΈΠ΅ Π΄Π»Ρ Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΠΈ ΠΏΡΠΎΡΡΠΎΡ ΡΠΈΡΡΠ΅ΠΌΡ. ΠΠ»Ρ Π½Π΅ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ½ΡΡ
Π·Π°ΡΠ²ΠΎΠΊ Π½Π°ΠΉΠ΄Π΅Π½Ρ Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΡ Π΅Π΅ ΡΠ±ΡΠΎΡΠ° ΠΈΠ· ΡΠΈΡΡΠ΅ΠΌΡ ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ½ΠΎΠΉ Π·Π°ΡΠ²ΠΊΠΎΠΉ, ΡΡΠ°ΡΠΈΠΎΠ½Π°ΡΠ½ΠΎΠ΅ ΡΠ°ΡΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΠ΅ Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ ΠΎΠΆΠΈΠ΄Π°Π½ΠΈΡ Π½Π°ΡΠ°Π»Π° ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ (Π² ΡΠ΅ΡΠΌΠΈΠ½Π°Ρ
ΠΏΡΠ΅ΠΎΠ±ΡΠ°Π·ΠΎΠ²Π°Π½ΠΈΠΉ ΠΠ°ΠΏΠ»Π°ΡΠ°-Π‘ΡΠΈΠ»ΡΡΠ΅ΡΠ° ΠΈ ΠΏΡΠΎΠΈΠ·Π²ΠΎΠ΄ΡΡΠΈΡ
ΡΡΠ½ΠΊΡΠΈΠΉ), Π° ΡΠ°ΠΊΠΆΠ΅ ΡΡΠ΅Π΄Π½Π΅Π΅ Π²ΡΠ΅ΠΌΡ ΠΎΠΆΠΈΠ΄Π°Π½ΠΈΡ Π½Π°ΡΠ°Π»Π° ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ
ΠΠ±Π·ΠΎΡ ΡΠΈΡΡΠ΅ΠΌ ΠΏΠ°ΡΠ°Π»Π»Π΅Π»ΡΠ½ΠΎΠΉ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ Π·Π°ΡΠ²ΠΎΠΊ. Π§Π°ΡΡΡ II
This paper is a continuation of the survey of the βfork-joinβ queuing systems (in the westernclassiο¬cation) or the systems with splitting of queries. Interest in such systems is explainedby a wide range of problems that can be solved with their help, since in fact it is a matter ofparallel processing of data and their applications. For example, this may concern the analysis ofdisk arrays, cloud computing, high-performance services and even the process of picking ordersin a warehouse. In the ο¬rst part of the survey, the main features of the described model (andrelated systems) and its construction were introduced. Also the detailed description of theapproach to obtaining an accurate expression of the average response time in the case of twodevices was presented as well as several methods of approximate analysis of this characteristic(the case when the number of devices is more than two). This part of the survey is devotedto the description of other existing methods for approximating the average response time. Inparticular, the approaches of the approximate analysis of the response time are as follows: thematrix-geometric method, the analysis with the help of order statistics for various types ofdistribution of the service time of subqueries.ΠΠ°Π½Π½Π°Ρ ΡΠ°Π±ΠΎΡΠ° ΡΠ²Π»ΡΠ΅ΡΡΡ ΠΏΡΠΎΠ΄ΠΎΠ»ΠΆΠ΅Π½ΠΈΠ΅ΠΌ ΠΎΠ±Π·ΠΎΡΠ° ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΡΠΈΡΡΠ΅ΠΌΡ ΠΌΠ°ΡΡΠΎΠ²ΠΎΠ³ΠΎΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ Π²ΠΈΠ΄Π° Β«fork-joinΒ» (Π² Π·Π°ΠΏΠ°Π΄Π½ΠΎΠΉ ΠΊΠ»Π°ΡΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ) ΠΈΠ»ΠΈ ΡΠΈΡΡΠ΅ΠΌΡ Ρ ΡΠ°ΡΡΠ΅ΠΏΠ»Π΅Π½ΠΈΠ΅ΠΌΠ·Π°ΠΏΡΠΎΡΠΎΠ². ΠΠ½ΡΠ΅ΡΠ΅Ρ ΠΊ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΠΌΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΠ΅ ΠΎΠ±ΡΡΡΠ½ΡΠ΅ΡΡΡ ΡΠΈΡΠΎΠΊΠΈΠΌ ΡΠΏΠ΅ΠΊΡΡΠΎΠΌ Π·Π°Π΄Π°Ρ, ΠΊΠΎΡΠΎΡΡΠ΅ ΠΌΠΎΠ³ΡΡ Π±ΡΡΡ ΡΠ΅ΡΠ΅Π½Ρ Ρ Π΅Ρ ΠΏΠΎΠΌΠΎΡΡΡ, ΠΏΠΎΡΠΊΠΎΠ»ΡΠΊΡ ΡΠ°ΠΊΡΠΈΡΠ΅ΡΠΊΠΈ ΡΠ΅ΡΡ ΠΈΠ΄ΡΡ ΠΎ ΠΏΠ°ΡΠ°Π»Π»Π΅Π»ΡΠ½ΠΎΠΉΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠ΅ Π΄Π°Π½Π½ΡΡ
ΠΈ ΠΈΡ
ΠΏΡΠΈΠ»ΠΎΠΆΠ΅Π½ΠΈΡΡ
. Π ΠΏΡΠΈΠΌΠ΅ΡΡ, ΡΡΠΎ ΠΌΠΎΠΆΠ΅Ρ ΠΊΠ°ΡΠ°ΡΡΡΡ Π°Π½Π°Π»ΠΈΠ·Π° ΡΠ°Π±ΠΎΡΡ Π΄ΠΈΡΠΊΠΎΠ²ΡΡ
ΠΌΠ°ΡΡΠΈΠ²ΠΎΠ², ΠΎΠ±Π»Π°ΡΠ½ΡΡ
Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΠΉ, Π²ΡΡΠΎΠΊΠΎΠΏΡΠΎΠΈΠ·Π²ΠΎΠ΄ΠΈΡΠ΅Π»ΡΠ½ΡΡ
ΡΠ΅ΡΠ²ΠΈΡΠΎΠ² ΠΈ Π΄Π°ΠΆΠ΅ ΠΏΡΠΎΡΠ΅ΡΡΠ°ΠΊΠΎΠΌΠΏΠ»Π΅ΠΊΡΠ°ΡΠΈΠΈ Π·Π°ΠΊΠ°Π·ΠΎΠ² Π½Π° ΡΠΊΠ»Π°Π΄Π΅. ΠΡΠ»ΠΈ Π² ΠΏΠ΅ΡΠ²ΠΎΠΉ ΡΠ°ΡΡΠΈ ΠΎΠ±Π·ΠΎΡΠ° Π±ΡΠ»ΠΈ ΠΎΠΏΠΈΡΠ°Π½Ρ ΠΎΡΠΎΠ±Π΅Π½Π½ΠΎΡΡΠΈΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ Π΄Π°Π½Π½ΠΎΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈ ΠΈ ΡΠΎΠ΄ΡΡΠ²Π΅Π½Π½ΡΡ
Π΅ΠΉ ΡΠΈΡΡΠ΅ΠΌ, Π° ΡΠ°ΠΊΠΆΠ΅ ΠΏΡΠΈΠ²Π΅Π΄Π΅Π½ΠΎ ΠΏΠΎΠ΄ΡΠΎΠ±Π½ΠΎΠ΅ ΠΎΠΏΠΈΡΠ°Π½ΠΈΠ΅ ΠΏΠΎΠ΄Ρ
ΠΎΠ΄Π° ΠΊ ΠΏΠΎΠ»ΡΡΠ΅Π½ΠΈΡ ΡΠΎΡΠ½ΠΎΠ³ΠΎ Π²ΡΡΠ°ΠΆΠ΅Π½ΠΈΡ ΡΡΠ΅Π΄Π½Π΅Π³ΠΎ Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ ΠΎΡΠΊΠ»ΠΈΠΊΠ° Π² ΡΠ»ΡΡΠ°Π΅ Π΄Π²ΡΡ
ΠΏΡΠΈΠ±ΠΎΡΠΎΠ² ΠΈ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ΠΎ Π½Π΅ΡΠΊΠΎΠ»ΡΠΊΠΎ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΏΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π° Π΄Π°Π½Π½ΠΎΠΉ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ Π² ΡΠ»ΡΡΠ°Π΅, ΠΊΠΎΠ³Π΄Π° ΡΠΈΡΠ»ΠΎ ΠΏΡΠΈΠ±ΠΎΡΠΎΠ² Π±ΠΎΠ»ΡΡΠ΅ Π΄Π²ΡΡ
, ΡΠΎ Π²ΠΎ Π²ΡΠΎΡΠΎΠΉ ΡΠ°ΡΡΠΈ ΠΎΠ±Π·ΠΎΡΠ° ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ΠΎΠΎΠΏΠΈΡΠ°Π½ΠΈΠ΅ Π΄ΡΡΠ³ΠΈΡ
ΡΡΡΠ΅ΡΡΠ²ΡΡΡΠΈΡ
ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² Π°ΠΏΠΏΡΠΎΠΊΡΠΈΠΌΠ°ΡΠΈΠΈ ΡΡΠ΅Π΄Π½Π΅Π³ΠΎ Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ ΠΎΡΠΊΠ»ΠΈΠΊΠ°. Π ΡΠ°ΡΡΠ½ΠΎΡΡΠΈ, ΠΊ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΠΌΡΠΌ ΠΏΠΎΠ΄Ρ
ΠΎΠ΄Π°ΠΌ ΠΏΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π° Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ ΠΎΡΠΊΠ»ΠΈΠΊΠ° ΠΎΡΠ½ΠΎΡΡΡΡΡ:ΠΌΠ°ΡΡΠΈΡΠ½ΠΎ-Π³Π΅ΠΎΠΌΠ΅ΡΡΠΈΡΠ΅ΡΠΊΠΈΠΉ ΠΌΠ΅ΡΠΎΠ΄, Π°Π½Π°Π»ΠΈΠ· Ρ ΠΏΠΎΠΌΠΎΡΡΡ ΠΏΠΎΡΡΠ΄ΠΊΠΎΠ²ΡΡ
ΡΡΠ°ΡΠΈΡΡΠΈΠΊ Π΄Π»Ρ ΡΠ°Π·Π»ΠΈΡΠ½ΡΡ
ΡΠΈΠΏΠΎΠ² ΡΠ°ΡΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΡ Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ ΠΏΡΠ΅Π±ΡΠ²Π°Π½ΠΈΡ ΠΏΠΎΠ΄Π·Π°ΠΏΡΠΎΡΠΎΠ²
APPLICATION OF TOUCHLESS METHODS FOR MAKING ENTRIES IN DENTAL RECORDS
This review focuses on the current issues of asepsis in dental settings and ways to prevent contact infection using touchless methods of making entries in dental records. Contact transmission is the main route of microbial contamination in dentistry. Various environmental surfaces in dental settings are difficult to disinfect, while contact with the staff's hands with the surfaces of computer equipment is inevitable. Continuous disinfection of the components of the computer hardware in the dental unit can cause damage and significantly reduce their useful life. The disinfection of the keyboard, touch screens, as well as other devices for entering dental records, is especially challenging. Alternative touchless methods for operating computers by dentists and nurses are already applied in various dental settings, such as surgery units, where a high level of sterility is required during operation. The use of such methods not only reduces the time spent by the patient in the dental chair but also excludes the contact of the doctor's hands with hard-to-clean surfaces, minimizing the chance of contact infection transmission
MEASURING OF AIRWAYS RESISTANCE BASED ON INTERRUPTER TECHNIQUE IN PRE-SCHOOLCHILDREN
Authors give information on limits of population norm for expiratory and inspiratory resistance by the interrupter technique indices (RINTexp and RINTinsp accordingly) in 214 healthy children 3β6 years old. Estimation of RINT was performed with spirograph Super Spiro with MicroRint module. Parameters of RINTexp and RINTinsp are similar in boys and girls. RINTexp depends on height of a child. Information on limits of normal rates is presented in this article, and this data can be used in diagnostics of respiratory pathology. Key words: children, age, resistance of airways, RINT, norm.(Voprosy sovremennoi pediatrii βΒ Current Pediatrics. 2010;9(5):30-34
Analysis of Cumulative Distribution Function of the Response Time in Cloud Computing Systems with Dynamic Scaling
One of the key performance measures of cloud computing systems is the response time. However, the mean value of this characteristic does not give the full picture of quality of service. Therefore, we derive the cumulative distribution function (CDF) of the response time in terms of Laplace-Stieltjes transform and use it to evaluate moments of the response time. Moreover, we introduce a simplification of the mathematical model that significantly reduces computing complexity for the response time CDF and provide analysis of approximation accuracy of the simplified model. Β© 2018, Allerton Press, Inc
Resource queuing systems as models of wireless communication systems
The article presents an overview of the resource queuing systems used for modeling of a wide class of real systems with admittedly limited resources. Despite the objective importance of studying of such systems, there have been very few works devoted to their analysis until recently, which was due to the complexity of constructing a random process to describe their functioning and, accordingly, of obtaining the numerical results. However, in recent years, there has been a significant shift in the study of the resource systems - new methods for their analysis have been proposed, which made it possible to construct recursive algorithms suitable for the numerical calculations. In this regard, the current review reflects only a part of the previously obtained results, namely, it considers the resource systems without waiting space with exponentially distributed service time. The authors consider the models of wireless communication systems based on resource queuing systems, expressions for estimating the main probabilistic, and temporal characteristics and algorithms for their calculation. Β© 2018 Federal Research Center Computer Science and Control of Russian Academy of Sciences