Aspects of a Dynamically Adaptive Operating System

-Real-time optimization of the overall performance of a large computer system or network such as an air-traffic control system or teleprocessing network inherently requires the introduction of adaptive control into selected control functions or sets of control functions. Such adaptive control is necessitated by the high variance of the available resource inventory and the workload resource demands within the system environment. Global management of the resulting multiloop control system becomes the responsibility of the operating system. Investigated aspects of this evolutionary extension of the operating system called the dynamically adaptive operating system (DAOS) include the general methodology and the real-time modeling and estimation of resource demands. The methodology specifies the general identification, decision, and modification processes required for an adaptive operating system. Support of such processes could be attractively provided by a peripheral or miniprocessor. The problem of estimating resource service times both with and without partial service times is explored and statistical models possessing utility for real-time modeling are developed. In particular, a dynamically partitioned second moment model (DPSMM) is described. The feasibility of such models is established with respect to a General Principle of Locality. Selected simulation results are presented to evaluate selected developments with respect to an adaptive central processing unit (CPU) scheduling discipline.

[1]  Gerald Estrin,et al.  Snuper computer: a computer in instrumentation automaton , 1967, AFIPS '67 (Spring).

[2]  K. Mani Chandy,et al.  Design automation and queueing networks: An interactive system for the evaluation of computer queueing models , 1972, DAC '72.

[3]  Peter J. Denning,et al.  Properties of the working-set model , 1972, CACM.

[4]  Gerald Estrin,et al.  Snuper Computer - A Computer Instrumentation Automation , 1899 .

[5]  James C. Browne,et al.  Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system , 1972, Commun. ACM.

[6]  C. V. Ramamoorthy The analytic design of a dynamic look-ahead and program segmenting system for multiprogrammed computers , 1966 .

[7]  William A. Wulf,et al.  Performance monitors for multi-programming systems , 1969, SOSP '69.

[8]  Philip M. Morse,et al.  Queues, Inventories, And Maintenance , 1958 .

[9]  R. Brown Statistical forecasting for inventory control , 1960 .

[10]  Arthur J. Bernstein,et al.  A policy-driven scheduler for a time-sharing system , 1971, CACM.

[11]  David F. Stevens Operating Systems: On overcoming high-priority paralysis in multiprogramming systems: a case history , 1968, CACM.

[12]  J. C. Browne,et al.  Trace driven modeling and analysis of CPU scheduling in a multi-programming system , 1971, SIGOPS Workshop on System Performance Evaluation.

[13]  Arnold D. Karush Two approaches for measuring the performance of time-sharing systems , 1969, SOSP '69.

[14]  F. Hanssmann,et al.  Modeling for Computing Center Planning , 1971, IBM Syst. J..

[15]  Donald P. Gaver,et al.  Probability Models for Multiprogramming Computer Systems , 1967, JACM.

[16]  Leonard Kleinrock,et al.  A contiuum of time-sharing scheduling algorithms , 1970, AFIPS '70 (Spring).

[17]  A. S. Noetzel The design of a meta-system , 1971, AFIPS '71 (Spring).

[18]  Virgil W. Eveleigh,et al.  Adaptive Control And Optimization Techniques , 1967 .

[19]  Edward G. Coffman,et al.  Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping , 1968, JACM.

[20]  Edward G. Coffman,et al.  Computer scheduling methods and their countermeasures , 1968, AFIPS Spring Joint Computing Conference.

[21]  Richard G. Hamlet Efficient multiprogramming resource allocation and accounting , 1973, CACM.

[22]  David F. Stevens ON OVERCOMING HIGH-PRIORITY PARALYSIS IN MULTI-PROGRAMMING SYSTEMS. , 1967 .

[23]  Keith D. Ryder A Heuristic Approach to Task Dispatching , 1970, IBM Syst. J..