论文信息 - Demand paging in perspective

Demand paging in perspective

The method of storage allocation known as "demand paging," first introduced by the designers of the Atlas computer, has a very appealing conceptual simplicity. Furthermore, the possibility that this technique could be used to allow programmers to ignore the problems of organizing information flow between working storage and one or more levels of backing storage was, to say the least, very tempting.

Brian Randell | C. J. Kuehner | B. Randell

[1] L. W. Comeau,et al. A study of the effect of user program optimization in a paging system , 1967, SOSP.

[2] Hugh C. Lauer,et al. Bulk core in a 360/67 time-sharing system , 1967, AFIPS '67 (Fall).

[3] Brian Randell,et al. Dynamic storage allocation systems , 1968, CACM.

[4] Tom Kilburn,et al. One-Level Storage System , 1962, IRE Trans. Electron. Comput..

[5] Daniel G. Bobrow,et al. Structure of a LISP system using two-level storage , 1967, CACM.

[6] Norman Weizer,et al. Resource management for a medium scale time-sharing operating system , 1968, CACM.

[7] J. L. Smith,et al. Comment on multiprogramming under a page on demand strategy , 1970, CACM.

[8] Laszlo A. Belady,et al. Dynamic space-sharing in computer systems , 1969, Commun. ACM.

[9] Laszlo A. Belady,et al. A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..

[10] Norman R. Nielsen,et al. The simulation of time sharing systems , 1967, Commun. ACM.

[11] A. C. McKellar,et al. The organization of matrices and matrix operations in a paged multiprogramming environment , 1968 .

[12] Brian Randell,et al. A note on storage fragmentation and program segmentation , 1969, CACM.

[13] Jacques Cohen,et al. A use of fast and slow memories in list-processing languages , 1967, CACM.

[14] John L. Smith. Microprogamming under a page on demand strategy , 1967, CACM.