The processor-sharing queueing model for time-shared systems with bulk arrivals Export

@article{citeulike:5794731, abstract = {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.}, address = {Computer Science Department, University of California, Los Angeles, California; Jet Propulsion Laboratory, Pasadena, California}, author = {Kleinrock, L. and Muntz, R. R. and Rodemich, E.}, citeulike-article-id = {5794731}, citeulike-linkout-0 = {http://dx.doi.org/10.1002/net.3230010103}, citeulike-linkout-1 = {http://www3.interscience.wiley.com/cgi-bin/abstract/113393830/ABSTRACT}, doi = {10.1002/net.3230010103}, issn = {1097-0037}, journal = {Networks}, keywords = {bulkarrival, processorsharing, ps, queueingmodel, queueingtheory}, number = {1}, pages = {1--13}, posted-at = {2009-09-17 10:54:10}, priority = {2}, title = {The processor-sharing queueing model for time-shared systems with bulk arrivals}, url = {http://dx.doi.org/10.1002/net.3230010103}, volume = {1}, year = {1971} }

TY - JOUR ID - citeulike:5794731 L3 - citeulike-article-id:5794731 N2 - 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. IS - 1 JF - Networks SN - 1097-0037 AD - Computer Science Department, University of California, Los Angeles, California; Jet Propulsion Laboratory, Pasadena, California EP - 13 TI - The processor-sharing queueing model for time-shared systems with bulk arrivals VL - 1 SP - 1 KW - bulkarrival KW - processorsharing KW - ps KW - queueingmodel KW - queueingtheory AU - Kleinrock, L AU - Muntz, RR AU - Rodemich, E PY - 1971/// UR - http://dx.doi.org/10.1002/net.3230010103 ER -