Demand paging through utilization of working sets onr the MANIAC II

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Demand paging through utilization of working sets onr the MANIAC II

Full text

Pdf (1.30 MB)

Source

Communications of the ACM archive
Volume 15 , Issue 10 (October 1972) table of contents

Pages: 867 - 872

Year of Publication: 1972

ISSN:0001-0782

Author

James B. Morris

Los Alamos Scientific Lab., Univ. of California, Los Alamos, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 19, Citation Count: 13

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355604.361592 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.

	1	B. W. Arden , B. A. Galler , T. C. O'Brien , F. H. Westervelt, Program and Addressing Structure in a Time-Sharing Environment, Journal of the ACM (JACM), v.13 n.1, p.1-16, Jan. 1966 [doi>10.1145/321312.321313]
	2	Belady, L. A. A study of replacement algorithms for virtual storage computers IBM Syst. 1, 5,2 (1996), 78-101.
	3	Peter J. Denning, The working set model for program behavior, Communications of the ACM, v.11 n.5, p.323-333, May 1968 [doi>10.1145/363095.363141]
	4	P. J. Denning, RESOURCE ALLOCATION IN MULTIPROCESS COMPUTER SYSTEMS, Massachusetts Institute of Technology, Cambridge, MA, 1968
	5	Denning, P.J. Thrashing. Its causes and prevention. Proc. AFIPS 1968 FJC, vol. 33, Montvale, N.J., pp. 915-922.
	6	Peter J. Denning, Virtual Memory, ACM Computing Surveys (CSUR), v.2 n.3, p.153-189, Sept. 1970 [doi>10.1145/356571.356573]
	7	Jack B. Dennis, Segmentation and the Design of Multiprogrammed Computer Systems, Journal of the ACM (JACM), v.12 n.4, p.589-602, Oct. 1965 [doi>10.1145/321296.321310]
	8	Gerald H. Fine , Calvin W. Jackson , Paul V. Mc Isaac, Dynamic program behavior under paging, Proceedings of the 1966 21st national conference, p.223-228, January 1966 [doi>10.1145/800256.810701]
	9	John Fotheringham, Dynamic storage allocation in the Atlas computer, including an automatic use of a backing store, Communications of the ACM, v.4 n.10, p.435-436, Oct. 1961 [doi>10.1145/366786.366800]
	10	Freitbergs, I. F. the dynamic behavior of programs. Proc. AFIPS 1968 FJCC, Vol. 33, AFIPS Press, Montvale, N.J., pp. 1163-1168.
	11	Hiffe, J.K. Basic Machine Principles. American Elsevier, New York, 1968.
	12	Kilburn, T., Edwards, D.B.G., Lanigan, M.J., and Summer, F.H. One-level storage system. IRE Trans. EC-11, 2 (Apr 1962), 223-235.
	13	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	14	Kuehner, C.J., and Randell. B. Demand paging in perspective Proc. AFIPS 1968 FJCC, Vol. 33, AFIPS Press, Montvale, N.J., pp. 1011-1018.
	15	G. Oppenheimer , N. Weizer, Resource management for a medium scale time-sharing operating system, Communications of the ACM, v.11 n.5, p.313-322, May 1968 [doi>10.1145/363095.363140]
	16	Paul W. Purdom, Jr. , Stephen M. Stigler, Statistical Properties of the Buddy System, Journal of the ACM (JACM), v.17 n.4, p.683-697, Oct. 1970 [doi>10.1145/321607.321617]
	17	B. Randell , C. J. Kuehner, Dynamic storage allocation systems, Communications of the ACM, v.11 n.5, p.297-306, May 1968 [doi>10.1145/363095.363138]
	18	Sbemer, J.E., and Shippey, G.A. Statistical analysis of paged and segmented computer systems. IEEE Trans. EC-15, 6 (Dec. 1966), 855-863.
	19	Michael D. Schroeder, Performance of the GE-645 associative memory while Multics is in operation, Proceedings of the SIGOPS workshop on System performance evaluation, p.227-245, January 1971 [doi>10.1145/800024.808361]
	20	Weizer, N., and Oppenheiner, G. Virtual memory management in a paging environment. Proc. AFIPS 1969 SJCC, Vol. 34, AFIPS Press, Montvale, N.J., pp. 249-256.

CITED BY 13

	Peter J. Denning, Why not innovations in computer architecture?, ACM SIGARCH Computer Architecture News, v.8 n.2, p.4-7, April 1980
	ACM Forum: memory management modeling, Communications of the ACM, v.19 n.8, p.476-477, Aug. 1976
	G. Scott Graham , Peter J. Denning, Multiprogramming and program behavior, ACM SIGMETRICS Performance Evaluation Review, v.3 n.4, p.1-8, December 1974
	Richard W. Carr , John L. Hennessy, WSCLOCK—a simple and effective algorithm for virtual memory management, ACM SIGOPS Operating Systems Review, v.15 n.5, p.87-95, December 1981
	William T. Marshall , C. Thomas Nute, Analytic modelling of “working set like” replacement algorithms, ACM SIGMETRICS Performance Evaluation Review, v.8 n.3, p.65-72, Fall 1979
	P. Macres , G. F. Coulouris, A microprogrammed storage management system for a paged stack machine, Conference record of the 7th annual workshop on Microprogramming, p.122-127, September 30-October 02, 1974, Pal Alto, California, United States
	Peter J. Denning , Kevin C. Kahn, An L=S criterion for optimal multiprogramming, Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, p.219-229, March 29-31, 1976, Cambridge, Massachusetts, United States
	Alan Jay Smith, Bibliography on paging and related topics, ACM SIGOPS Operating Systems Review, v.12 n.4, p.39-56, October 1978
	Carl E. Landwehr, An endogenous priority model for load control in combined batch - interactive computer systems, Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, p.282-295, March 29-31, 1976, Cambridge, Massachusetts, United States
	David K. Gifford, Hardware estimation of a process' primary memory requirements, Communications of the ACM, v.20 n.9, p.655-663, Sept. 1977
	Song Jiang , Xiaodong Zhang, Token-ordered LRU: an effective page replacement policy and its implementation in Linux systems, Performance Evaluation, v.60 n.1-4, p.5-29, May 2005
	Marc H. Fogel, The VMOS paging algorithm: a practical implementation of the working set model, ACM SIGOPS Operating Systems Review, v.8 n.1, p.8-17, January 1974
	Vidyadhar Phalke, A time invariant working set model for independent reference, Proceedings of the 33rd annual on Southeast regional conference, March 17-18, 1995, Clemson, South Carolina

INDEX TERMS

Keywords:
Maniac II, demand paging, dynamic storage allocation, memory allocation, one-level store, paging, paging associative memory, storage allocation, trashing, virtual memory, working set model

Collaborative Colleagues:

James B. Morris: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player