Premium
The processor‐sharing queueing model for time‐shared systems with bulk arrivals
Author(s) -
Kleinrock L.,
Muntz R. R.,
Rodemich E.
Publication year - 1971
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230010103
Subject(s) - processor sharing , computer science , queueing theory , time sharing , multiplexing , constant (computer programming) , shared resource , distributed computing , service (business) , response time , function (biology) , queueing system , computer network , telecommunications , operating system , economy , evolutionary biology , economics , biology , programming language
We consider a model which is applicable to time‐multi‐plexed systems, such as multiplexed communication channels and time‐shared computing facilities. In this (processor‐sharing) queueing model, all jobs currently in the system share equally the processing capability of the server. In this paper, we investigate the processor‐sharing model for the case of bulk arrivals. The mean response time of the system as a function of required service time is derived. An example is given to show the effect of bulk arrivals versus single arrivals for a constant utilization.