IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v351y2019icp48-65.html
   My bibliography  Save this article

On limiting characteristics for a non-stationary two-processor heterogeneous system

Author

Listed:
  • Zeifman, A.
  • Satin, Y.
  • Kiseleva, K.
  • Korolev, V.
  • Panfilova, T.

Abstract

We study a non-stationary Markovian queueing model of a two-processor heterogeneous system and obtain basic limiting characteristics for this model. Some specific examples are considered illustrated by the corresponding plots.

Suggested Citation

  • Zeifman, A. & Satin, Y. & Kiseleva, K. & Korolev, V. & Panfilova, T., 2019. "On limiting characteristics for a non-stationary two-processor heterogeneous system," Applied Mathematics and Computation, Elsevier, vol. 351(C), pages 48-65.
    • Handle: RePEc:eee:apmaco:v:351:y:2019:i:c:p:48-65
    DOI: 10.1016/j.amc.2019.01.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319300414
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.01.032?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Schwarz, Justus Arne & Selinka, Gregor & Stolletz, Raik, 2016. "Performance analysis of time-dependent queueing systems: Survey and classification," Omega, Elsevier, vol. 63(C), pages 170-189.
    2. Zeifman, A.I. & Korolev, V.Yu. & Satin, Ya.A. & Kiseleva, K.M., 2018. "Lower bounds for the rate of convergence for continuous-time inhomogeneous Markov chains with a finite state space," Statistics & Probability Letters, Elsevier, vol. 137(C), pages 84-90.
    3. Di Crescenzo, Antonio & Giorno, Virginia & Nobile, Amelia G., 2016. "Constructing transient birth–death processes by means of suitable transformations," Applied Mathematics and Computation, Elsevier, vol. 281(C), pages 152-171.
    4. Zeifman, A.I., 1995. "Upper and lower bounds on the rate of convergence for nonhomogeneous birth and death processes," Stochastic Processes and their Applications, Elsevier, vol. 59(1), pages 157-173, September.
    5. Zeifman, A.I. & Korolev, V.Yu., 2014. "On perturbation bounds for continuous-time Markov chains," Statistics & Probability Letters, Elsevier, vol. 88(C), pages 66-72.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zeifman, A.I. & Satin, Y.A. & Kiseleva, K.M., 2020. "On obtaining sharp bounds of the rate of convergence for a class of continuous-time Markov chains," Statistics & Probability Letters, Elsevier, vol. 161(C).
    2. Alexander Zeifman & Victor Korolev & Yacov Satin, 2020. "Two Approaches to the Construction of Perturbation Bounds for Continuous-Time Markov Chains," Mathematics, MDPI, vol. 8(2), pages 1-25, February.
    3. Yacov Satin & Rostislav Razumchik & Alexander Zeifman & Ilya Usov, 2024. "On One Approach to Obtaining Estimates of the Rate of Convergence to the Limiting Regime of Markov Chains," Mathematics, MDPI, vol. 12(17), pages 1-12, September.
    4. Ekaterina Markova & Yacov Satin & Irina Kochetkova & Alexander Zeifman & Anna Sinitcina, 2020. "Queuing System with Unreliable Servers and Inhomogeneous Intensities for Analyzing the Impact of Non-Stationarity to Performance Measures of Wireless Network under Licensed Shared Access," Mathematics, MDPI, vol. 8(5), pages 1-13, May.
    5. Yacov Satin & Alexander Zeifman & Anastasia Kryukova, 2019. "On the Rate of Convergence and Limiting Characteristics for a Nonstationary Queueing Model," Mathematics, MDPI, vol. 7(8), pages 1-11, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yacov Satin & Alexander Zeifman & Alexander Sipin & Sherif I. Ammar & Janos Sztrik, 2020. "On Probability Characteristics for a Class of Queueing Models with Impatient Customers," Mathematics, MDPI, vol. 8(4), pages 1-15, April.
    2. Alexander Zeifman & Victor Korolev & Yacov Satin, 2020. "Two Approaches to the Construction of Perturbation Bounds for Continuous-Time Markov Chains," Mathematics, MDPI, vol. 8(2), pages 1-25, February.
    3. Zeifman, A.I. & Satin, Y.A. & Kiseleva, K.M., 2020. "On obtaining sharp bounds of the rate of convergence for a class of continuous-time Markov chains," Statistics & Probability Letters, Elsevier, vol. 161(C).
    4. Yacov Satin & Rostislav Razumchik & Ivan Kovalev & Alexander Zeifman, 2023. "Ergodicity and Related Bounds for One Particular Class of Markovian Time—Varying Queues with Heterogeneous Servers and Customer’s Impatience," Mathematics, MDPI, vol. 11(9), pages 1-15, April.
    5. Zeifman, A.I. & Korolev, V.Yu. & Satin, Ya.A. & Kiseleva, K.M., 2018. "Lower bounds for the rate of convergence for continuous-time inhomogeneous Markov chains with a finite state space," Statistics & Probability Letters, Elsevier, vol. 137(C), pages 84-90.
    6. Yacov Satin & Alexander Zeifman & Anastasia Kryukova, 2019. "On the Rate of Convergence and Limiting Characteristics for a Nonstationary Queueing Model," Mathematics, MDPI, vol. 7(8), pages 1-11, July.
    7. Zeifman, A.I. & Korolev, V. Yu., 2015. "Two-sided bounds on the rate of convergence for continuous-time finite inhomogeneous Markov chains," Statistics & Probability Letters, Elsevier, vol. 103(C), pages 30-36.
    8. Giorno, Virginia & Nobile, Amelia G., 2022. "On some integral equations for the evaluation of first-passage-time densities of time-inhomogeneous birth-death processes," Applied Mathematics and Computation, Elsevier, vol. 422(C).
    9. Pei, Zhi & Dai, Xu & Yuan, Yilun & Du, Rui & Liu, Changchun, 2021. "Managing price and fleet size for courier service with shared drones," Omega, Elsevier, vol. 104(C).
    10. Zeifman, A.I. & Korolev, V.Yu., 2014. "On perturbation bounds for continuous-time Markov chains," Statistics & Probability Letters, Elsevier, vol. 88(C), pages 66-72.
    11. Korolev, V.Yu. & Chertok, A.V. & Korchagin, A.Yu. & Zeifman, A.I., 2015. "Modeling high-frequency order flow imbalance by functional limit theorems for two-sided risk processes," Applied Mathematics and Computation, Elsevier, vol. 253(C), pages 224-241.
    12. Andersen, Anders Reenberg & Nielsen, Bo Friis & Reinhardt, Line Blander & Stidsen, Thomas Riis, 2019. "Staff optimization for time-dependent acute patient flow," European Journal of Operational Research, Elsevier, vol. 272(1), pages 94-105.
    13. Ansari, Sardar & Yoon, Soovin & Albert, Laura A., 2017. "An approximate hypercube model for public service systems with co-located servers and multiple response," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 143-157.
    14. Tsiligianni, Christiana & Tsiligiannis, Aristeides & Tsiliyannis, Christos, 2023. "A stochastic inventory model of COVID-19 and robust, real-time identification of carriers at large and infection rate via asymptotic laws," European Journal of Operational Research, Elsevier, vol. 304(1), pages 42-56.
    15. Mahes, Roshan & Mandjes, Michel & Boon, Marko & Taylor, Peter, 2024. "Adaptive scheduling in service systems: A Dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 312(2), pages 605-626.
    16. Alexander Zeifman & Yacov Satin & Ivan Kovalev & Rostislav Razumchik & Victor Korolev, 2020. "Facilitating Numerical Solutions of Inhomogeneous Continuous Time Markov Chains Using Ergodicity Bounds Obtained with Logarithmic Norm Method," Mathematics, MDPI, vol. 9(1), pages 1-20, December.
    17. Satin, Y.A. & Razumchik, R.V. & Zeifman, A.I. & Kovalev, I.A., 2022. "Upper bound on the rate of convergence and truncation bound for non-homogeneous birth and death processes on Z," Applied Mathematics and Computation, Elsevier, vol. 423(C).
    18. Erik Doorn, 2011. "Rate of convergence to stationarity of the system M/M/N/N+R," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(2), pages 336-350, December.
    19. Zeifman, A.I. & Razumchik, R.V. & Satin, Y.A. & Kovalev, I.A., 2021. "Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy," Applied Mathematics and Computation, Elsevier, vol. 395(C).
    20. Virginia Giorno & Amelia G. Nobile, 2020. "Bell Polynomial Approach for Time-Inhomogeneous Linear Birth–Death Process with Immigration," Mathematics, MDPI, vol. 8(7), pages 1-29, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:351:y:2019:i:c:p:48-65. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.