MULTI-CLASS RESOURCE SHARING WITH PREEMPTIVE PRIORITIES

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 cos...

Full description

Saved in:
Bibliographic Details
Published inProbability in the engineering and informational sciences Vol. 32; no. 3; pp. 323 - 339
Main Author Mitrani, Isi
Format Journal Article
LanguageEnglish
Published New York, USA Cambridge University Press 01.07.2018
Subjects
Computer simulation
Mathematical models
Preempting
Queues
Resource scheduling
Virtual environments
stochastic modeling
queueing theory
simulation
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0269-9648
1469-8951
DOI:10.1017/S0269964817000286