Dynamic program behavior under paging

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Dynamic program behavior under paging

Full text

Pdf (454 KB)

Source

ACM Annual Conference/Annual Meeting archive
Proceedings of the 1966 21st national conference table of contents

Pages: 223 - 228

Year of Publication: 1966

Authors

Gerald H. Fine
Calvin W. Jackson
Paul V. Mc Isaac

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 15, Citation Count: 46

Additional Information:

abstract 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/800256.810701 What is a DOI?

ABSTRACT

In May, 1965, System Development Corporation (SDC) proposed to do some research to study program organization with respect to dynamic program behavior. Further, the proposal suggested that simulation techniques might be used to study the problem of resource allocation in a multiprocessor time-sharing system. Some of the reasons for the proposal related to the prospective utilization of the time-sharing hardware features of the GE and IBM time-sharing computers. At the time, there was considerable interest in investigating the concepts of program segmentation and page turning, both at SDC and in the time-sharing community at large. The concept of fixed-size paging on demand particularly, raised some questions of practicality. One of the early papers on the subject by Dennis and Glaser1 states that the concept of page-turning can be either useful or disastrous, depending on the class of information to which it is applied. However, the theory appeared to be both advantageous and elegant, so that the future of time-sharing seemed to be committed to the concept.

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	J B DENNIS E L GLASER The structure of on-line information processing systems Proceedings of the Second Congress on the Information System Sciences p 6 1965
	2	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]
	3	J I SCHWARTZ E G COFFMAN C WEISSMAN A general-purpose time-sharing system SDC document SP-1499 31 pp 29 April 1964

CITED BY 46

	A. C. McKellar , E. G. Coffman, Jr., Organizing matrices and matrix operations for paged memory systems, Communications of the ACM, v.12 n.3, p.153-165, March 1969
	John L. Smith, Microprogamming under a page on demand strategy, Communications of the ACM, v.10 n.10, p.636-646, Oct. 1967
	Jerome H. Saltzer, A simple linear model of demand paging performance, Communications of the ACM, v.17 n.4, p.181-186, April 1974
	John G. Williams, Asymmetric memory hierarchies, Communications of the ACM, v.16 n.4, p.213-222, April 1973
	S. J. Morganstein , J. Winograd , R. Herman, Sim/61: A simulation measurement tool for a time-shared, demand paging operating system, Proceedings of the SIGOPS workshop on System performance evaluation, p.142-172, January 1971
	Peter J. Denning, The working set model for program behavior, Communications of the ACM, v.11 n.5, p.323-333, May 1968
	J. Winograd , S. J. Morganstein , R. Herman, Simulation studies of a virtual memory, time-shared, demand paging operating system, Proceedings of the third ACM symposium on Operating systems principles, p.149-155, October 18-20, 1971, Palo Alto, California, United States
	L. A. Belady , C. J. Kuehner, Dynamic space-sharing in computer systems, Communications of the ACM, v.12 n.5, p.282-288, May 1969
	J. L. Smith, Comment on multiprogramming under a page on demand strategy, Communications of the ACM, v.13 n.4, p.265, April 1970
	L. C. Varian , E. G. Coffman, An empirical study of the behavior of programs in a paging environment, Proceedings of the first ACM symposium on Operating System Principles, p.16.1-16.13, January 1967
	Peter J. Denning, The working set model for program behavior, Proceedings of the first ACM symposium on Operating System Principles, p.15.1-15.12, January 1967
	J. Winograd , S. J. Morganstein , R. Herman, Simulation studies of a virtual memory, time-shared, demand paging operating system, ACM SIGOPS Operating Systems Review, v.6 n.1/2, June 1972
	V. L. Wallace , D. L. Mason, Degree of multiprogramming in page-on-demand systems, Communications of the ACM, v.12 n.6, p.305-308, June 1969
	B. Randell, A note on storage fragmentation and program segmentation, Communications of the ACM, v.12 n.7, p.365-ff., July 1969
	Peter J. Denning, Virtual Memory, ACM Computing Surveys (CSUR), v.2 n.3, p.153-189, Sept. 1970
	Peter J. Denning, The working set model for program behavior, Communications of the ACM, v.26 n.1, p.43-48, Jan. 1983
	John W. McCredie, Jr., Measurement criteria for virtual memory paging rules, Proceedings of the 1969 24th national conference, p.193-199, August 26-28, 1969
	E. G. Coffman , L. C. Varian, Further experimental data on the behavior of programs in a paging environment, Communications of the ACM, v.11 n.7, p.471-474, July 1968
	Tad B. Pinkerton, Performance monitoring in a time-sharing system, Communications of the ACM, v.12 n.11, p.608-610, Nov. 1969
	L. A. Belady , R. A. Nelson , G. S. Shedler, An anomaly in space-time characteristics of certain programs running in a paging machine, Communications of the ACM, v.12 n.6, p.349-353, June 1969
	John W. Boyse, Execution characteristics of programs in a page-on-demand system, Communications of the ACM, v.17 n.4, p.192-196, April 1974
	Peter Wegner, Machine organization for multiprogramming, Proceedings of the 1967 22nd national conference, p.135-150, January 1967, Washington, D.C., 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
	Marc Fogel , Joseph Winograd, EINSTEIN: an internal driver in a time-sharing environment, ACM SIGOPS Operating Systems Review, v.6 n.3, p.6-14, October 1972
	W. M. De Meis , N. Weizer, Measurement and analysis of a demand paging Time Sharing System, Proceedings of the 1969 24th national conference, p.201-216, August 26-28, 1969
	Jules I. Schwartz , Clark Weissman, The SDC Time-Sharing System revisited, Proceedings of the 1967 22nd national conference, p.263-271, January 1967, Washington, D.C., United States
	Alfred V. Aho , Peter J. Denning , Jeffrey D. Ullman, Principles of Optimal Page Replacement, Journal of the ACM (JACM), v.18 n.1, p.80-93, Jan. 1971
	James B. Morris, Demand paging through utilization of working sets onr the MANIAC II, Communications of the ACM, v.15 n.10, p.867-872, Oct. 1972
	M. K. Rajaraman, Performance prediction of a virtual machine, ACM SIGMETRICS Performance Evaluation Review, v.8 n.1-2, p.57-62, Spring-Summer 1979
	E. Gelenbe , P. Tiberio , J.C. A. Boekhorst, Page size in demand-paging systems, Proceeding of the 1973 ACM SIGME symposium, p.1-12, January 1973
	Thomas Murray Cook, Schedule—constrained job scheduling in a multiprogrammed computer system, Proceedings of the 7th conference on Winter simulation, p.675-685, January 14-16, 1974, Washington, DC
	M. K. Rajaraman, Performance of a virtual memory: some experimental results, ACM SIGMETRICS Performance Evaluation Review, v.8 n.4, p.63-68, Winter 1979-1980
	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
	N. A. Oliver, Experimental data on page replacement algorithm, Proceedings of the May 6-10, 1974, national computer conference and exposition, May 06-10, 1974, Chicago, Illinois
	R. R. Linde , C. Weissman , C. E. Fox, The ADEPT-50 time-sharing system, Proceedings of the November 18-20, 1969, fall joint computer conference, November 18-20, 1969, Las Vegas, Nevada
	Wesley W. Chu , Holger Opderbeck, The page fault frequency replacement algorithm, Proceedings of the December 5-7, 1972, fall joint computer conference, part I, December 05-07, 1972, Anaheim, California
	Peter J. Denning, Thrashing: its causes and prevention, Proceedings of the December 9-11, 1968, fall joint computer conference, part I, December 09-11, 1968, San Francisco, California
	Hugh C. Lauer, Bulk core in a 360/67 time-sharing system, Proceedings of the November 14-16, 1967, fall joint computer conference, November 14-16, 1967, Anaheim, California
	Barbara S. Brawn , Frances G. Gustavson, Program behavior in a paging environment, Proceedings of the December 9-11, 1968, fall joint computer conference, part II, December 09-11, 1968, San Francisco, California
	C. J. Kuehner , B. Randell, Demand paging in perspective, Proceedings of the December 9-11, 1968, fall joint computer conference, part II, December 09-11, 1968, San Francisco, California
	Harry Katzan, Jr., Operating systems architecture, Proceedings of the May 5-7, 1970, spring joint computer conference, May 05-07, 1970, Atlantic City, New Jersey
	Jules I. Schwartz, Interactive systems: promises, present and future, Proceedings of the December 9-11, 1968, fall joint computer conference, part I, December 09-11, 1968, San Francisco, California
	I. F. Freibergs, The dynamic behavior of programs, Proceedings of the December 9-11, 1968, fall joint computer conference, part II, December 09-11, 1968, San Francisco, California
	D. D. Chamberlin , S. H. Fuller , L. Y. Liu, An analysis of page allocation strategies for multiprogramming systems with virtual memory, IBM Journal of Research and Development, v.17 n.5, p.404-412, September 1973
	R. P. Parmelee , T. I. Peterson , C. C. Tillman , D. J. Hatfield, Virtual storage and virtual machine concepts, IBM Systems Journal, v.11 n.2, p.99-130, June 1972
	H. Hellerman, Some principles of time-sharing scheduler strategies, IBM Systems Journal, v.8 n.2, p.94-117, June 1969