Time-Shared Computer Operations With Both Interarrival and Service Times Exponential
Journal of the ACM (JACM)
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Fairness in processor scheduling in time sharing systems
ACM SIGOPS Operating Systems Review
Analysis of Two Time-Sharing Queueing Models
Journal of the ACM (JACM)
Adaptive Allocation of Central Processing Unit Quanta
Journal of the ACM (JACM)
An Evaluation of CPU Efficiency Under Dynamic Quantum Allocation
Journal of the ACM (JACM)
Determination of the conditional response for quantum allocation algorithms
Journal of the ACM (JACM)
A Survey of Analytical Time-Sharing Models
ACM Computing Surveys (CSUR)
A unifying approach to scheduling
Communications of the ACM
The role of computer system models in performance evaluation
Communications of the ACM
A processor allocation method for time-sharing
Communications of the ACM
Design considerations of statistical multiplexors
Proceedings of the first ACM symposium on Problems in the optimization of data communications systems
Simulation of dispatching algorithms in a multiprogramming environment
ACM '72 Proceedings of the ACM annual conference - Volume 2
A simulation study of a demand-driven scheduling algorithm
ANSS '75 Proceedings of the 3rd symposium on Simulation of computer systems
Schedule—constrained job scheduling in a multiprogrammed computer system
WSC '74 Proceedings of the 7th conference on Winter simulation - Volume 2
Aspects of a Dynamically Adaptive Operating System
IEEE Transactions on Computers
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
A study of multiaccess computer communications
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
A study of asynchronous time division multiplexing for time-sharing computer systems
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Performance evaluation: a structured approach
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
| Hi-index | 0.06 |
The necessity for swapping in the operation of modern time-sharing systems constitutes the major reason for the latter's inefficiency compared to batch-processing systems. Time-sharing algorithms are discussed which are designed primarily for the reduction of swapping without intolerable changes in the waiting time distributions. A particular class of such algorithms in which conventional procedures are modified by making the quantum allocation dependent on input activity is given a more detailed treatment. In particular, queueing models corresponding to these algorithms are devised and then analyzed for the purpose of obtaining the mean waiting times conditioned on the service required. These results are then compared to those obtained for the conventional models and the comparison subsequently measured against the swapping requirements of the two classes of algorithms.