Skip to main content

The Effect of Sharing on Page Replacement

  • Conference paper
Book cover GI — 9. Jahrestagung

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 19))

  • 61 Accesses

Abstract

The influence of sharing on page replacement on demand is discussed. An explicit formula is presented which calculates the probability of a shared page to be in main memory out of the probabilities in case of the single programs running in isolation. Based on this formula two applications of the same page replacement algorithm which mainly differ with respect to the handling of shared pages are compared. Some illustrative numbers are derived by heuristic evaluation.

This paper was produced under project A4 — Struktur von Betriebssystemen und ihre Verpflanzung — of the Sonderforschungsbereich 49, Programmiertechnik, München.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bard, Y.: Application of the page survival index (PSI) to virtual memory system performance. IBM J. R and D 19, 212–220 (1975)

    Article  MathSciNet  Google Scholar 

  2. Coffman Jr., Edward G., Denning, Peter J.: Operating Systems Theory. Prentice Hall, Inc., Englewood Cliffs 1973

    Google Scholar 

  3. Denning, Peter, J.: Working sets: then and now. Proc. Second Int. Symposium on Operating Systems, IRIA, Rocquencourt, 1978

    Google Scholar 

  4. Dijkstra, Edsger W.: A time-wise hierarchy imposed upon the use of a two level store. EDW408 (1973) or in Language Hierarchies and Interfaces, Bauer, F.L. and Samelson, K. (eds.), Lecture Notes in Computer Science 46, p. 345–356, (1976)

    Google Scholar 

  5. Kemeny, John G., Snell, Laurie J.: Finite Markov Chains. D. Van Nostrand Company, Inc., Princeton, New Jersey, 1960

    MATH  Google Scholar 

  6. Montgomery, W., Montgomery, A.: Measurements of sharing in Multics. Proc. SOSP-6, 84–90, 1977

    Google Scholar 

  7. Welch, Peter D.: On the self-containing modelling of DB/DC systems. Acta Informatica 7, 227–247 (1976)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Stiegler, H.G. (1979). The Effect of Sharing on Page Replacement. In: Böhling, K.H., Spies, P.P. (eds) GI — 9. Jahrestagung. Informatik-Fachberichte, vol 19. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67444-0_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-67444-0_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09664-1

  • Online ISBN: 978-3-642-67444-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics