An analysis of multiprogrammed time-sharing computer systems

Authors:
M. A. Sencer;C. L. Sheng
Affiliations:
The University of Ottawa, Ottawa, Canada;The University of Ottawa, Ottawa, Canada
Venue:
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
Year:
1973

Citing 11
Cited 0

Sequencing Aspects of Multiprogramming

Journal of the ACM (JACM)
Analysis of Real Time Multiprogramming

Journal of the ACM (JACM)
Sequential Processing Machines (S.P.M) Analyzed With a Queuing Theory Model

Journal of the ACM (JACM)
Probability Models for Multiprogramming Computer Systems

Journal of the ACM (JACM)
Production and Stabilization of Real-Time Task Schedules

Journal of the ACM (JACM)
Waiting Time Distributions for Processor-Sharing Systems

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)
A Dynamic Time-Sharing Priority Queue

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

ACM Computing Surveys (CSUR)
Timesharing system design concepts (McGraw-Hill computer science series)

Timesharing system design concepts (McGraw-Hill computer science series)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The size of the investment required and the complexity of the time-sharing computer systems, TSCS, necessitate a good deal of effort to be spent on the analysis of the resource allocation problems which are obviously tied to the cost and the congestion properties of the system configuration. In this paper we study the congestion problems in the multiprogramming TSCS's.