MULTI-CLASS RESOURCE SHARING WITH PREEMPTIVE PRIORITIES

被引：2
|
作者：
Mitrani, Isi [1 ]
机构：
[1] Newcastle Univ, Sch Comp Sci, Newcastle Upon Tyne, Tyne & Wear, England
来源：
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES | 2018年 / 32卷 / 03期
关键词：
queueing theory; simulation; stochastic modeling; MULTIPLE SERVERS; SYSTEMS; QUEUE;
D O I：
10.1017/S0269964817000286
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Different virtual machines can share servers, subject to resource constraints. Incoming jobs whose resource requirements cannot be satisfied are queued and receive service according to a preemptive-resume scheduling policy. The problem is to evaluate a cost function, including holding and server costs, with a view to searching for the optimal number of servers. A model with two job types is analyzed exactly and the results are used to develop accurate approximations, which are then extended to more than two classes. Numerical examples and comparisons with simulations are presented.
引用
收藏
页码：323 / 339
页数：17
相关论文
共 50 条
  • [1] Approximations for Markovian multi-class queues with preemptive priorities
    van der Heijden, M
    van Harten, A
    Sleptchenko, A
    OPERATIONS RESEARCH LETTERS, 2004, 32 (03) : 273 - 282
  • [2] MULTI-CLASS RESOURCE SHARING WITH BATCH ARRIVALS
    Ezhilchelvan, Paul
    Mitrani, Isi
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2019, 33 (03) : 348 - 366
  • [3] An Exact Solution for the State Probabilities of the Multi-Class, Multi-Server Queue with Preemptive Priorities
    Andrei Sleptchenko
    Aart van Harten
    Matthieu van der Heijden
    Queueing Systems, 2005, 50 : 81 - 107
  • [4] An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities
    Sleptchenko, A
    Van Harten, A
    Van der Heijden, M
    QUEUEING SYSTEMS, 2005, 50 (01) : 81 - 107
  • [5] Multi-class Resource Sharing with Batch Arrivals and Complete Blocking
    Ezhilchelvan, Paul
    Mitrani, Isi
    QUANTITATIVE EVALUATION OF SYSTEMS (QEST 2017), 2017, 10503 : 157 - 169
  • [6] Joint queue length distribution of multi-class, single-server queues with preemptive priorities
    Sleptchenko, Andrei
    Selen, Jori
    Adan, Ivo
    van Houtum, Geert-Jan
    QUEUEING SYSTEMS, 2015, 81 (04) : 379 - 395
  • [7] HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES
    Izagirre, A.
    Verloop, I. M.
    Ayesta, U.
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2015, 29 (02) : 153 - 180
  • [8] Joint queue length distribution of multi-class, single-server queues with preemptive priorities
    Andrei Sleptchenko
    Jori Selen
    Ivo Adan
    Geert-Jan van Houtum
    Queueing Systems, 2015, 81 : 379 - 395
  • [9] Supporting dynamic inter-class resource sharing: A multi-class QoS routing algorithm
    Ma, QM
    Steenkiste, P
    IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW, 1999, : 649 - 660
  • [10] Supporting dynamic inter-class resource sharing: A multi-class QoS routing algorithm
    Ma, Qingming
    Steenkiste, Peter
    Proceedings - IEEE INFOCOM, 1999, 2 : 649 - 660
12345