ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Converting a swap-based system to do paging in an architecture lacking page-referenced bits
Full text PdfPdf (780 KB)
Source ACM SIGOPS Operating Systems Review archive
Volume 15 ,  Issue 5  (December 1981) table of contents
Pages: 78 - 86  
Year of Publication: 1981
ISSN:0163-5980
Also published in ...
Authors
Özalp Babaoglu  Department of Computer Science, Cornell University, Ithaca, New York
William Joy  Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, Berkeley, California
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 41,   Citation Count: 24
Additional Information:

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

ABSTRACT

This paper discusses the modifications made to the UNIX operating system for the VAX-11/780 to convert it from a swap-based segmented system to a paging-based virtual memory system. Of particular interest is that the host machine architecture does not include page-referenced bits. We discuss considerations in the design of page-replacement and load-control policies for such an architecture, and outline current work in modeling the policies employed by the system. We describe our experience with the chosen algorithms based on benchmark-driven studies and production system use.


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
Ö. Babao&gmarc;lu, "Analysis of a Class of Hybrid Page Replacement Policies," Collection Seminaires INRIA, Modelisation et Evaluation des Systemes Informatique, 1980, pp. 289-317.
 
2
 
3
Ö. Babao&gmarc;lu, "Memory Management as Inventory Control," in preparation, 1981.
 
4
L. A. Belady, "A Study of Replacement Algorithms for a Virtual Storage Computer," IBM Syst. J., vol. 5, pp. 78-101, 1966.
5
 
6
W. W. Chu and H. Opderbeck, "Program Behavior and the Page Fault Frequency Replacement Algorithm," Computer, vol. 9, November 1976, pp. 29-38.
 
7
 
8
F. J. Corbato, "A Paging Experiment with the Multics System," Project MAC Memo MAC-M-384, Mass. Inst. of Tech., July 1968, published in In Honor of P. M. Morse, MIT Press 1969, pp. 217-228.
 
9
Digital Equipment Corporation, "VAX/VMS Internals and Data Structures," Preliminary version AA-K785A-TE, November 1980.
10
 
11
P. J. Denning, "Thrashing: It's Causes and Prevention," Proc. Fall Joint Comptr. Conf., 1968, pp. 915-922.
 
12
P. J. Denning, K. C. Kahn, J. Leroudier, D. Potier and R. Suri, "Optimal Multiprogramming," Acta Informatica, vol. 7, 1976, pp. 197-216.
13
 
14
M. Easton and P. A. Franaszek, "Use Bit Scanning in Replacement Decisions," IEEE Trans. Comptrs., vol. C-28, February 1979, pp. 133-141.
15
 
16
W.N. Joy, "Comments on the Performance of UNIX on the VAX," Computer Science Division internal report, University of California, Berkeley, 1980.
 
17
D. Kashtan, "VMS and UNIX: A Performance Comparison," Stanford Research Institute internal memorandum, February 1980.
 
18
W. F. King III, "Analysis of Demand Paging Algorithms," Proc. IFIPS Congress, Ljubljana, Yugoslavia, 1971, pp. TA-3-155 - TA-3-159.
19
 
20
N. A. Oliver, "Experimental Data on Page Replacement Algorithm," Proc. NCC, 1974, pp. 179-184.
 
21
A. J. Smith, "Multiprogramming and Memory Contention," Software- Practice and Experience, vol. 10, July 1980, pp. 531-552.
 
22
A. J. Smith, "Internal Scheduling and Memory Contention," IEEE Trans. on Software Engineering, vol. SE-7, January 1981, pp. 135-146.

CITED BY  24

Collaborative Colleagues:
Özalp Babaoglu: colleagues
William Joy: colleagues