T. C. Pewitt
ABSTRACT
This paper presents the design and an evaluation method of an operating system in which the optimization of system utilization is controlled by resource-demanded dispatching of program segments and dynamic scheduling of segment execution. The basic departure of the proposed system design from the operating systems currently in use is that system resources, especially I/O facilities, have much more control over the scheduling of task execution. Each system resource can actively request the dispatcher to activate program segments that use it, whenever the queue length of its associated queue falls under a dynamically adjustable threshold. Program tasks are broken into small segments and resource requirements of these segments are obtained by the system to control segment dispatching. The method of dynamic optimization of the proposed system is presented together with the method for testing the new control algorithms using an existing operating system.
- 1.Buzen, J., "Analysis of System Bottlenecks Using a Queueing Network Model", Proc. ACM SIGOPS Workshop on System Performance Evaluation, Harvard University, 1971, pp 82-103. Google Scholar
Digital Library
- 2.Chang, W., "Single-server Queueing Processes in Computing Systems", IBM Systems Journal, Vol 9, No. 1, 1970, pp 36-71.Google ScholarDigital Library
- 3.Denning, P. J., "Principles of Computer System Organization", Proc. 1971 ACM Annual Conference, pp 45-55. Google ScholarDigital Library
- 4.Gordon, W. J., and G. F. Newell, "Closed Queueing Systems with Exponential Servers", Operations Research, Vol. 15, No. 2, April 1967, pp 254-265.Google ScholarDigital Library
- 5.IBM Corporation, IBM System/360 Operating System Assembler (F) Programmer's Guide, Order No. GC 26-3756.Google Scholar
- 6.IBM Corporation, IBM System 360 Operating System Linkage Editor (F), Order No. GY 28-6667.Google Scholar
- 7.IBM, System/360 Operating System MVT Supervisor, Order No. GY 28-6659.Google Scholar
- 8.McKinney, J. M., "A Survey of Analytical Time Sharing Models", Computer Surveys, Vol. 1, No. 2, June 1969, pp 105-116. Google ScholarDigital Library
- 9.Sayers, A. P., (ed), Operating Systems Survey, Auerback, Princeton, N.J., 1971Google Scholar
- 10.Wilde, D. J. and C. S. Beightler, Foundations of Optimization, Prentice-Hall, Englewood Cliffs, N. J., 1967.Google Scholar
Index Terms
- Resource demanded paging and dispatching to optimize resource utilization in an operating system
Recommendations
Improving resource utilization by timely fine-grained scheduling
EuroSys '20: Proceedings of the Fifteenth European Conference on Computer SystemsMonotask is a unit of work that uses only a single type of resource (e.g., CPU, network, disk I/O). While monotask was primarily introduced as a means to reason about job performance, in this paper we show that this fine-grained, resource-oriented ...
Resource reconstruction algorithms for on-demand allocation in virtual computing resource pool
Resource reconstruction algorithms are studied in this paper to solve the problem of resource on-demand allocation and improve the efficiency of resource utilization in virtual computing resource pool. Based on the idea of resource virtualization and ...
Comments