B. Krishnamoorthi
Abstract
The concept of time-shared computer operations is briefly described and a model of a time-sharing system is proposed, based on the assumption that both interarrival and service times possess an exponential distribution. Although the process described by this model is non-Markovian, an imbedded Markov chain is analyzed by exploiting the fact that the instants of completion of a “quantum” of service are regeneration points. It is shown that user congestion possesses a limiting distribution, and the method of generating functions is used to derive this distribution. The concept of cycle time is discussed and two measures of cycle time developed for a scheduling discipline employing a single queue. Finally, a number of numerical examples are presented to illustrate the effect of the system parameters upon user congestion, system response time and computer efficiency.
- 1 COFFMAN, E. G., AND KISNAMOORTHI, B. Preliminary analyses of time-shared eomputer operation. SP-1719, System Development Corp., Santa Moniea, Aug. 1964.Google Scholar
- 2 CORBATO, F. T., MERWIN-DAGGET M., AND DALEY, R.C. An experimental time-sharing system. Proc. SJCC, Vol. 21, t962, pp. 335--344.Google Scholar
- 3 KIEINROCK, L. Message Delay in Communication Nets with Storage. McGraw Hill, New York, 1964.Google Scholar
- 4 McCARTHY, J. S., BOILEN, E., AND LICKLIDER, Z. C.R. A time-sharing debugging system for a small computer. Proc. SJCC, 1963, pp. 51-57.Google Scholar
- 5 SCHWARTZ, J. I., COFFMAN E. G., AND WEISSMAN, C. A general purpose time-sharingsystem. Proc. SJCC, 1964, pp. 397--411.Google Scholar
- 6 ScawAaTZ, J. I., COFFMAN, E. G., AND WEISSMAN, C. Potentials of a large scale timesharing system. Proc. Second Congress of Inf. Sciences, Nov. 1964. (Also available as SP-1723, System Development Corp., Santa Monica.)Google Scholar
- 7 BHAIIICI-REID, A.T. Elements of the Theory of Markov Processes and Their Applicatiots. McGraw Hill, New York, 1960, pp. 419--425.Google Scholar
- 8 CHUNG, K. L. Markov Chains with Stationary Transition Probabilities. Springer-Verlag, Berlin, 1960, p. 87.Google Scholar
- 9 FELIma, WIILIA. An Introduction to Probability Theory and Its Applications, Vol. l. John Wiley, New York, 1957.Google Scholar
- 10 FLoaEs, IVAN. Derivation of a waiting-time factor for a multiple bank memory. J. ACM 11, 3, (July 1964), 265-282. Google Scholar
- 11 KalSrrNAMOORTrlI, B. The stationary behavior of a time-sharing system under Poisson assumptions. SP-2090, System Development Corp., Santa Monica, Aug. 1965; to appear OPSEA RCH, d. Indian Operat. Res. Soc.Google Scholar
Index Terms
- Time-Shared Computer Operations With Both Interarrival and Service Times Exponential
Recommendations
On queues with service and interarrival times depending on waiting times
We consider an extension of the standard G/G/1 queue, described by the equation $W\stackrel{ \mathcal {D}}{=}\max\mathrm{max}\,\{0,B-A+YW\}$ , where [ Y =1]= p and [ Y = 1]=1 p . For p =1 this model reduces to the classical Lindley equation for the waiting time in the G/G/1 queue, whereas for p =0 it ...
Sojourn times in polling systems with various service disciplines
We consider a polling system of N queues Q"1,...,Q"N, cyclically visited by a single server. Customers arrive at these queues according to independent Poisson processes, requiring generally distributed service times. When the server visits Q"i, i=1,...,...
From Exhaustive Vacation Queues to Preemptive Priority Queues with General Interarrival Times
AbstractWe consider the discrete-time G/GI/1 queueing system with multiple exhaustive vacations. By a transform approach, we obtain an expression for the probability generating function of the waiting time of customers in such a system. We then ...
Comments