L. A. Belady
Abstract
A formalization of relationships between space-sharing, program behavior, and processor efficiency in computer systems is presented. Concepts of value and cost of space allocation per task are defined and then value and cost are combined to develop a single parameter termed value per unit cost.
The intent is to illustrate a possible analytic approach to the investigation of the problems of space-sharing and to demonstrate the method on sample problems.
- 1 RANDELL, B. AND KUEHNER, C .J . Dynamic storage allocation systems. Comm. ACM 11, (May 1968), 297-306. Google Scholar
Digital Library
- 2 CODD, E.F. Multiprogram scheduling. Comm. ACM S, (1960), 347-35O. Google ScholarDigital Library
- 3 DENNING, P. The working set model for program behavior. Comm. ACM 11, 5 (May 1968), 323-333. Google ScholarDigital Library
- 4 BELADY, L.A. A study of replacement algorithms for a virtual storage computer. IBM Syst. J. 5, 2 (1966), 78-101.Google ScholarDigital Library
- 5 O'NEILL, R. W. Experience using a time-sharing multiprogramming system with dynamic address relocation hardware. Proc. AFIPS 1967 Spring Joint Comput. Conf., Vol. 30, Thompson Book Co., Washington D. C., pp. 611-621.Google Scholar
- 6 FINE, G. H., JACKSON, C. W., AND MCIssAc, P.V. Dynamic program behavior under paging. Proc. ACM 21st Nat. Conf., 1966, Thompson Book Co., Washington, D. C., pp. 223-228. Google ScholarDigital Library
- 7 VARIAN, L. C. AND COFFMAN, E. An empirical study of the behavior of programs in a paging environment. Presented at the ACM Symposium on Operating System Principles, Gatlinburg, Tenn. October 1967. Google ScholarDigital Library
- 8 BELADY, L. A. Biased replacement algorithms for multiprogramming. Rep. NC 697, IBM Thomas J. Watson Res. Center, Yorktown Heights, N. Y., Mar. 1967.Google Scholar
- 9 DENNING, P. Resource allocation in multiprocess computer systems. Doctoral Diss., MIT, June 1968.Google Scholar
Index Terms
- Dynamic space-sharing in computer systems
Recommendations
Experiments on the Knee Criterion in a Multiprogrammed Computer System
Although the effectiveness of the knee criterion [7] as a virtual memory management strategy is widely accepted, it has been impossible to take advantage of it in a practical system, because little information is available about the program behavior of ...
Dynamic memory allocation in computer simulation
e of 35 dynamic memory allocation algorithms when used to service simulation programs as represented by 18 test cases. Algorithm performance was measured in terms of processing time, memory usage, and external memory fragmentation. Algorithms ...
Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines
The deadline of a request is the time instant at which its execution must complete. The deadline of the request in any period of a job with deferred deadline is some time instant after the end of the period. The authors describe a semi-static priority-...
Comments