The Working Set Model for Program Behavior

Peter J. Denning, 1968, Communications of the ACM

About this paperTiếng Việt日本語

This paper is under a licence that does not allow it to be reproduced, so what is here is its front matter and a short abstract. Read it at the publisher's page.

中文
English

程序行为的工作集模型

Peter J. Denning

麻省理工学院，剑桥，马萨诸塞州

现代计算机系统中缺少对资源分配的一般处理的最基本原因，可能是缺乏一个足够的程序行为模型。本文提出并发展了一种新模型，即“工作集模型”。与一个进程相关联的页面的工作集，被定义为其最近使用的页面集合，为分页内存的动态管理提供了至关重要的知识。我们说明“进程”和“工作集”是同一持续计算活动的表现形式；随后定义“处理器需求”和“内存需求”；并将资源分配表述为在需求与可用设备之间进行平衡的问题。

关键词和短语：一般操作系统概念，多处理，多道程序设计，操作系统，程序行为，程序模型，资源分配，调度，存储分配

CR 分类：4.30，4.32

  1. 引言

资源分配是一项棘手的工作。最近，人们对进程调度和主内存管理进行了大量讨论，然而技术的发展却沿着这两个方向独立推进。没有人会否认，需要一种统一的方法。本文将说明，建立一种统一的方法是可能的。从观察到每个正在运行的程序会同时对所有系统资源，特别是处理器和内存，提出需求开始，我们最终定义“系统需求”；资源分配问题将由在需求与可用资源之间进行平衡构成。

Probably the most basic reason behind the absence of a general treatment of resource allocation in modern computer systems is an adequate model for program behavior. In this paper a new model, the "working set model," is developed. The working set of pages associated with a process, defined to be the collection of its most recently used pages, provides knowledge vital to the dynamic management of paged memories. "Process" and "working set" are shown to be manifestations of the same ongoing computational activity; then "processor demand" and "memory demand" are defined; and resource allocation is formulated as the problem of balancing demands against available equipment.

KEY WORDS AND PHRASES: general operating system concepts, multiprocessing, multiprogramming, operating systems, program behavior, program models, resource allocation, scheduling, storage allocation CR CATEGORIES: 4.30, 4.32

This section is missing here.

1 Introduction

This section is missing here.

2 Background

This section is missing here.

3 Working Set Model

This section is missing here.

4 Scheduling

This section is missing here.

5 Sharing

This section is missing here.

6 Resource Allocation: A Balancing Problem

This section is missing here.

7 Conclusions

References

  1. Dennis, J. B., and Van Horn, E. C. Programming semantics for multiprogrammed computations. Comm. ACM 9 (Mar. 1966), 143–155.
  2. Ramamoorthy, C. V. The analytic design of a dynamic look ahead and program segmenting system for multiprogrammed computers. Proc. ACM 21st Nat. Conf. 1966. Thompson Book Co., Washington, D.C., pp. 229–239.
  3. Fano, R. M., and David, E. E. On the social implications of accessible computing. Proc. AFIPS 1965 Fall Joint Comput. Conf., Vol. 27, Part 2. Thompson Book Co., Washington, D.C., pp. 243–247.
  4. Selwyn, L. L. The information utility. Indust. Man. Rev. 7, 2 (spring, 1966).
  5. Parkhill, D. The Challenge of the Computer Utility. Addison-Wesley, Reading, Mass., 1966.
  6. Dennis, J. B. Segmentation and the design of multiprogrammed computer systems. J. ACM 12, 4 (Oct. 1965), 589–602.
  7. Arden, B. W., et al. Program and address structure in a time-sharing environment. J. ACM 13, 1 (Jan. 1966), 1–16.
  8. Saltzer, J. H. Traffic control in a multiplexed computer system. M.I.T. Project MAC Tech. Rep. MAC-TR-30, M.I.T., Cambridge, Mass., July 1966.
  9. Dennis, J. B. Program structure in a multi-access computer. Project MAC Tech. Rep. MAC-TR-11, M.I.T., Cambridge, Mass.
  10. Fine, G. H., McIsaac, P. V., and Jackson, C. W. Dynamic program behavior under paging. Proc. ACM 21st Nat. Conf. 1966. Thompson Book Co., Washington, D.C., pp. 223–228.
  11. Varian, L., and Coffman, E. An empirical study of the behavior of programs in a paging environment. Proc. ACM Symp. on Operating Principles, Gatlinburg, Tenn., Oct. 1967.
  12. Kilburn, T., et al. One-level storage system. IRE Trans. EC-11, 2 (Apr. 1962).
  13. Belady, L. A. A study of replacement algorithms for a virtual storage computer. IBM Systems J. 5, 2 (1966), 78–101.
  14. Progress Report III, M.I.T. Project MAC, 1965–66, pp. 63–66.
  15. Denning, P. J. Memory allocation in multiprogrammed computers. Project MAC Computation Structures Group Memo 24, M.I.T., Cambridge, Mass., Mar. 1966.
  16. Fife, D. W. An optimization model for time-sharing. Proc. AFIPS 1966 Spring Joint Comput. Conf., Vol. 28. Spartan Books, New York, pp. 97–104.
  17. Oppenheimer, G., and Weizer, N. Resource management for a medium scale time-sharing operating system. Comm. ACM 11, 5 (May 1968), 313–322.

Read off the page by a vision model reading the page images using olmOCR-2-7B-1025-FP8. Translated into 中文 by gpt-5, against glossary version 6. Translated from the English.

Read off the page by a vision model reading the page images using olmOCR-2-7B-1025-FP8.