Skip to main content

Server Utilizations for Programs with Individual Pagefault Behavior. A Simple Model

  • Chapter
Modelle für Rechensysteme

Part of the book series: Informatik — Fachberichte ((INFORMATIK,volume 9))

  • 27 Accesses

Abstract

Programs are alternately served by the processor and the paging server. The service disciplines are F.C.F.S., all individual service time distributions are different and we specify to negative exponential distribution functions. Performance measures are compared with the corresponding M/M/1/n model results, and changes in pagefault behavior are discussed.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. F. Baskett, K.M. Chandy, R.R. Müntz, F.G. Palacios, Open, closed and mixed networks of queues with different classes of customers, J. ACM 22 248–260 (1975).

    Article  MATH  Google Scholar 

  2. M.Z. Ghanem, Study of memory partitioning for multiprogramming systems with virtual memory, IBM J.R. and D. 19 451–457 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  3. C.H. Sauer, K.M. Chandy, Approximate analysis of central server models, IBM J.R. and D. 19, 301–313 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  4. W.S. Jewell, A simple proof of: L = λW, Oper. Res. 15, 1109–1116 (1967).

    Article  MathSciNet  MATH  Google Scholar 

  5. E.G. Coffman, P.J. Denning, Operating systems theory, Prentice Hall Inc., New Jersey (1973) p. 218–219.

    Google Scholar 

  6. L.A. Belady, C.J. Kuehner, Dynamic space sharing in computer systems. Comm. ACM 12 282–288 (1969).

    Article  MATH  Google Scholar 

  7. M. Posner, B. Bernholtz, Closed finite queuing networks with time lags and with several classes of units, Oper. Res. 16, 977–985 (1968).

    Article  MATH  Google Scholar 

  8. L. Kleinrock, Queuing systems vol II, John Wiley & Sons Inc., New York (1976).

    Google Scholar 

  9. W.R. Franta, The mathematical analysis of the computer modeled as a two stage cyclic queue. Acta Informatica 6 187–209 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  10. M. Badel, E. Gelenbe, J. Leroudier, D. Potier, Adaptive optimization of the performance of a virtual memory computer, in computer architectures and networks, ed. by E. Gelenbe, R. Mahl, North Holland Publ. Cie, Amsterdam (1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin · Heidelberg

About this chapter

Cite this chapter

van der Wal, S.G. (1977). Server Utilizations for Programs with Individual Pagefault Behavior. A Simple Model. In: Spies, P.P. (eds) Modelle für Rechensysteme. Informatik — Fachberichte, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45499-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45499-8_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08206-4

  • Online ISBN: 978-3-642-45499-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics