Automatic load adjustment in time-sharing systems

  • Authors:
  • M. V. Wilkes

  • Affiliations:
  • -

  • Venue:
  • Proceedings of the SIGOPS workshop on System performance evaluation
  • Year:
  • 1971

Quantified Score

Hi-index 0.02

Visualization

Abstract

The paper is concerned with the automatic adjustment of the number of console users on a time-sharing system according to the total load on the system. The control procedure comprises two algorithms. The first makes a periodic assessment ahead of time of the number of tasks that it would be necessary to insert into the system in order to keep the number of tasks actually within it (including those waiting on queues) under control. The second algorithm adjusts the number of users so that, when the system is under control, the number of tasks actually entering is, on the average, equal to the target number calculated in advance. The design of the first algorithm is critical from the point of view of stability and the greater part of the paper is devoted to a discussion of it based on the theory of linear recurrence relations. In designing the second algorithm, the main consideration is the avoidance of oscillation in the number of permitted users without, however, making the system so heavily damped that it is unresponsive.