A Time-Sharing Queue with a Finite Number of Customers

Authors:
I. Adiri;B. Avi-Itzhak
Affiliations:
Technion-Israel Institute of Technology, Department of Industrial and Management Engineering, Technion City, Haifa, Israel;Technion-Israel Institute of Technology, Department of Industrial and Management Engineering, Technion City, Haifa, Israel
Venue:
Journal of the ACM (JACM)
Year:
1969

Citing 1
Cited 12

Time-Shared Computer Operations With Both Interarrival and Service Times Exponential

Journal of the ACM (JACM)

Busy Period Analysis of a Time-Sharing System Modeled as a Semi-Markov Process

Journal of the ACM (JACM)
Control of initialization bias in multivariate simulation response

Communications of the ACM - Special issue on simulation modeling and statistical computing
Analysis of future event set algorithms for discrete event simulation

Communications of the ACM
An analysis of some time-sharing techniques

Communications of the ACM
Simulation of dispatching algorithms in a multiprogramming environment

ACM '72 Proceedings of the ACM annual conference - Volume 2
The dependence of computer system queues upon processing time distribution and central processor scheduling

SOSP '71 Proceedings of the third ACM symposium on Operating systems principles
Statistical analysis of simulation output data

ANSS '76 Proceedings of the 4th symposium on Simulation of computer systems
The initial transient in steady state simulation (Panel Discussion)

WSC '81 Proceedings of the 13th conference on Winter simulation - Volume 1
The dependence of computer system queues upon processing time distribution and central processor scheduling

ACM SIGOPS Operating Systems Review
Measurement and performance of a multiprogramming system

SOSP '69 Proceedings of the second symposium on Operating systems principles
Statistical analysis of simulation output data

ACM SIGSIM Simulation Digest
Swap-Time Considerations in Time-Shared Systems

IEEE Transactions on Computers

Quantified Score

Hi-index	0.04

Visualization

Abstract

A time-sharing queue serving a finite number of customers is described. It is assumed that both the service time and the time elapsing between termination of service and the next arrival of the same customer at the queue (service station) are exponential. The model was studied by Krishnamoorthi and Wood, but their results are not in complete agreement with the results of this paper. In addition, some new results are presented in terms of steady-state expectations.