ACM Home Page
Please provide us with feedback. Feedback
Virtual Memory
Full text PdfPdf (2.63 MB)
Source ACM Computing Surveys (CSUR) archive
Volume 2 ,  Issue 3  (September 1970) table of contents
Pages: 153 - 189  
Year of Publication: 1970
ISSN:0360-0300
Author
Peter J. Denning  Department of Electrical Engineering, Princeton University, Princeton, New Jersey
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 95,   Downloads (12 Months): 382,   Citation Count: 181
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/356571.356573
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
A1
ABATE, J., AND DUBNER, It. Optimizing the performance of a drum-like storage. IEEE Trans. C-18, 11 (Nov. 1969), 992-997.
 
A2
AHO, A. V., DENNING, P. J., AND ULLMAN, J. D. Principles of optimal page replacement. Computer Science Tech. Rep. No. 82, Princeton U., Princeton, N. J., Jan. 1970.
 
A3
ANACKER, W., AND WANG, C.P. Performance evaluation of computing systems with memhierarchies. IEEE Trans. EC-16 (Dec. 1967), 764-772.
A4
A5
 
B1
BASKETT, F., BROWNE, J. C., AND RAIKE, M. The management of a multi-level non-paged memory system. ProP. AFIPS 1970 Spring Joint Comput. Conf., Vol. 36, 459-465.
B2
B3
B6
B7
B8
 
B9
BRAWN, B., AND GUSTAVSON, F. Program behavior in a paging environment. Proc. AFIPS 1968 Fall Joint Comput. Conf., Vol. pp. 1019-1032.
 
B10
BURROUGHS CORPORATION. The descriptor --A definition of the B5000 information processing system. Burroughs Corp., 1961.
 
C1
CHar,-, Y. C. Selective transfer analysis. Rep. RC-1926, IBM T. J. Watson Research Center, Yorktown Heights, N. Y., 1968.
C2
C3
C4
C5
C6
C7
 
C8
CORBATS, F. J. A paging experiment with the Multies s'rstem. Rep. MAC-M-384, MIT Project MAC' Cambridge, Mass., May 1968.
D1
D2
 
D3
DENNING, P. ft. Effects of scheduling on file memory operations. Proc. AFIPS 1967 Spring Joint Comput. Conf., Vol. 30, pp. 9-21.
D4
 
D5
 
D6
____, Thrashing: Its causes and prevention. Proc. AFIPS 1968 Fall Joint Comput. Cool., Vol. 33, pp. 915-922.
 
D7
____, Equipment configuration in balanced computer systems. IEEE Trans. C-t8 (Nov. 1969), 1008-1012.
 
D8
____ AND BRVNO, J.L. On the management of multilevel memories. Computer Science Tech. Rep. 76, Princeton U., Princeton, N. J., April 1969.
 
D9
____, CHEN, Y. C., AND SHEDLER, G. S. A model for program behavior under demand paging. R ep. RC-2301, IBM T. J. Watson Kes. Center, Yorktown Heights, N. Y., Sept. t968.
 
D10
D11
 
D12
____, AND GLASS.R, E. L. The structure of on-line information processing systems. Proc. Second Congress on Information Syst. Sci., Spartan Books, Washington, D. C., 1965, pp. 5-14.
D13
 
D14
____, Programming generality, parallelism and computer architecture. Proc. IFIP Congr. 1968, Vol. 1, North-Holland, Amsterdam, 1969, pp. 484-492 (Computation Struetures Group Memo 32, MIT Project MAC, Cambridge, Mass., Aug. 1968).
F1
F2
F3
 
F4
FREIBERGS, I. F. The dynamic behavior of programs. Proc. AF1PS 1968 Fall Joint Comput. Conf., Vol. 33, pp. 1163-1168.
F5
H1
H2
 
I1
ILIFFE, J. K. Basic Machine Principles. American Elsevier, New York, 1968.
 
I2
___ AND JODEIT, J. G. A dynamic storage allocation scheme. Comput. d. 5 (Oct,. 1962), 200-209.
 
J1
JOHNSTON, J. B. The structure of multiple activity algorithms. Proc. Third Annual Princeton wonf., Princeton, N. J., March 1969.
 
J2
JONES, R.M. Factors affecting the efiiciency of a virtual memory. IEEE Trans. C-I8, 11 (Nov. 1969), 1004-1008.
K1
K2
 
K3
KILBURN, T., EDWARDS, D. B. G., LANIGAN, M. J., AND SUMNER, F.H. One-level storage system. IRE Trans. EC-I1, 2 (April 1962), 223-235.
 
K4
 
K5
KUCK, D. J., AND LAWRIE, D. H. The use and performance of memory hierarchies: A survey. Tech. P~ep. No. 363, Dep. of Computer Sci., U. of Illinois, Urbana, Ill., Dec. 1969.
 
K6
KUBHNER, C. J., AND RANDELL, B. Demand paging in perspective. Proc. AFIPS 1968 Fall Joint Comput. Conf., Vol. 33, pp. 1011-1018.
 
L1
LAVEa, H. Bulk core in a 360/67 time sharing system. Proc. AFIPS 1967 Fall Joint Comput. Conf., Vol. 31, pp. 601-609.
 
L2
LIPTAY, ft. S. The cache. IBM Sysl. J. 7, 1 (1968), 15-21.
 
M1
MACKENZIE, F. B. Automated secondary storage management. Datamation 11, 11 (1965), 24-28.
 
M2
MATTSON, R. L., GECSEI, J., SLUTZ, D. R., AND TRAIOER, I. W. Evaluation Techniques for Storage Hierarchies. IBM Syst. J. 9, 2 (1970), 78-117.
M3
M4
 
M5
M IT. Report of the long range computation study group, April 1961.
O1
 
O2
Experience using a time sharing multiprogramming system wit.h dynamic address relocation hardware. Proc. AFIPS 1967 Spring Joint Comput. Conf., Vol. 30, pp. 611-621.
O3
 
P1
P2
R1
R2
R3
R4
S1
S2
 
S3
SHEMER, J. E., AND GUPTA, S. C. On the design of Bayesian storage allocation algorithms for paging and segmentation. IEEE Trans. C-I8, 7 (July 1969), 644-651.
 
S4
___ AND SHIPPEY, B. Statistical analysis of paged and segmented computer systems. IEEE Trans. EC-t5, 6 (Dec. 1966), 855-863.
S5
 
S6
STONE, H. S. A logic-in-memory computer. IEEE Trans. C.19, 1 (Jan. 1970), 73-78.
V1
W1
 
W2
WEIZER, N., ANY OPPEN~IEIMlilR, G. Virtual memory management in a paging environ+ ment. Proc. AFIPS 1969 Spring Joint Comput. Conf., Vol. 34, p. 234.
 
W3
WILKES, M. V. Slave memories and dynamic storage allocation. IEEE Trans.EC-14 (April 1965), 270-271.
 
W4
W5
 
W6
____. h model for core space allocation in a time sharing system. Proe. AFIPS 1969 Spring Joint Comput Conf., Vol. 34, pp. 265-271.
W7

CITED BY  181