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

Authors:
B. Krishnamoorthi;Roger C. Wood
Affiliations:
Stanford University, Stanford, California;University of California at Santa Barbara and System Development Corporation, Santa Monica, California
Venue:
Journal of the ACM (JACM)
Year:
1966

Citing 1
Cited 21

Derivation of a Waiting-Time Factor for a Multiple-Bank Memory

Journal of the ACM (JACM)

Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping

Journal of the ACM (JACM)
Feedback Queueing Models for Time-Shared Systems

Journal of the ACM (JACM)
A Time-Sharing Queue with a Finite Number of Customers

Journal of the ACM (JACM)
A Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems

Journal of the ACM (JACM)
Busy Period Analysis of a Time-Sharing System Modeled as a Semi-Markov Process

Journal of the ACM (JACM)
An Evaluation of CPU Efficiency Under Dynamic Quantum Allocation

Journal of the ACM (JACM)
Measurement Bias in Feedback Queues

Journal of the ACM (JACM)
A Survey of Analytical Time-Sharing Models

ACM Computing Surveys (CSUR)
Memory management and response time

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

Communications of the ACM
Estimates of distributions of random variables for certain computer communications traffic models

Communications of the ACM
Network computer modeling

ACM '72 Proceedings of the ACM annual conference - Volume 1
Estimates of distributions of random variables for certain computer communications traffic models

Proceedings of the first ACM symposium on Problems in the optimization of data communications systems
Throughput analysis of computer systems - multiprogramming versus multiprocessing

Proceedings of the SIGOPS workshop on System performance evaluation
Studies in Markov models of computer systems

ACM '75 Proceedings of the 1975 annual conference
Schedule—constrained job scheduling in a multiprogrammed computer system

WSC '74 Proceedings of the 7th conference on Winter simulation - Volume 2
Swap-Time Considerations in Time-Shared Systems

IEEE Transactions on Computers
Computer scheduling methods and their countermeasures

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Performance modeling and empirical measurements in a system designed for batch and time-sharing users

AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Single-server queuing processes in computing systems

IBM Systems Journal
An analysis of computer operations under running time priority disciplines

Symposium on Interactive Systems for Experimental Applied Mathematics: Proceedings of the Association for Computing Machinery Inc. Symposium

Quantified Score

Hi-index	0.05

Visualization

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.