Skip to main content
SpringerLink
Log in
Book cover

Conference on Operating Systems

OS 1974: Operating Systems pp 56–88Cite as

Equivalence and decomposition methods with application to a model of a time-sharing virtual memory system

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 16))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. C.G. Moore, Network Models for Large Scale Time-Sharing Systems, Ph. D. Thesis, University of Michigan, 1971.

    Google Scholar 

  2. J. Buzen, Queueing Network Models of Multiprogramming, Ph. D. Thesis, Harvard University, 1971.

    Google Scholar 

  3. S.R. Arora and A. Gallo, The Optimal Organization of Multiprogrammed Multi-Level Memory, Proc. ACM-SIGOPS Workshop on System Performance Evaluation, April 1971, 104–141.

    Google Scholar 

  4. A.L. Scherr, An Analysis of Time-Shared Computer Systems, M.I.T. Press, Cambridge, Mass., 1967.

    Google Scholar 

  5. A. Sekino, Throughput Analysis of Multiprogrammed Virtual-Memory Computer Systems, 1st Annual SIGME Symposium on Measurement and Evaluation, 1973, 47–53.

    Google Scholar 

  6. J.R. Jackson, Jobshop-Like Queueing Systems, Management Science, 10, 1, October 1963, 131–142.

    Google Scholar 

  7. R.R. Muntz and F. Baskett, Open, Closed and Mixed Networks of Queues with different Classes of Customers, Stanford Electronic Laboratories, Technical Report, Nℴ33, August 1972.

    Google Scholar 

  8. L. Belady and C.J. Kuehner, Dynamic Space Sharing in Computer Systems, Comm. ACM, Vol. 12, Nℴ5, May 1969, 282–288.

    Article  Google Scholar 

  9. J.H. Saltzer, A simple linear model of demand paging performance, Massachusetts Institute of Technology Project MAC Report (To appear).

    Google Scholar 

  10. D. Chamberlin, S. Fuller, L. Liu, An Analysis of Page Allocation Strategies for Multiprogramming Systems with Virtual Memory I.B.M. J. Res. Develop., September 1973.

    Google Scholar 

  11. H. Simon and A. Ando, Aggregation of Variables in Dynamic Systems,Econometrica, Vol. 20, Nℴ2, April 1961.

    Google Scholar 

  12. A. Ando and F.M. Fisher, Near-Decomposability, Partition and Aggregation, and the Relevance of Stability Discussions, International Economic Review vol. 4, nℴ1, January 1963.

    Google Scholar 

  13. P. Courtois, On the Near-Complete-Decomposability of Networks of Queues and of Stochastic Models of Multiprogramming Computing Systems, Carnegie Melon Report, November 1971.

    Google Scholar 

  14. J.D. Little, A proof of the queueing formula L=λW, Oper. Res. 9, 1961, 383–387.

    Google Scholar 

  15. A. Brandwajn, Control Schemes in Queueing networks (to appear).

    Google Scholar 

  16. T.L. Saaty, Elements of Queueing theory, Mac Graw-hill, New York, 1961.

    Google Scholar 

  17. A. Brandwajn, E. Gelenbe, D. Potier, J. Lenfant, Modèle de système multiprogrammé à mémoire virtuelle paginée, Compte Rendu des journées d'études sur les recherches en mesure, simulation, modélisation de systèmes informatiques, IRIA, Toulouse, juin 1973.

    Google Scholar 

  18. E. Gelenbe, D. Potier, A. Brandwajn, J. Lenfant, Gestion d'un ordinateur multiprogrammé à mémoire virtuelle, 5th Conference on Optimization Techniques, Springer, Berlin, 1973.

    Google Scholar 

  19. A. Brandwajn, A model of a time-sharing virtual memory system solved using equivalence and decomposition methods, (to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIA-LABORIA, France

    A. Brandwajn

Authors
  1. A. Brandwajn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Gelenbe C. Kaiser

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brandwajn, A. (1974). Equivalence and decomposition methods with application to a model of a time-sharing virtual memory system. In: Gelenbe, E., Kaiser, C. (eds) Operating Systems. OS 1974. Lecture Notes in Computer Science, vol 16. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029354

Download citation

  • DOI: https://doi.org/10.1007/BFb0029354

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06849-5

  • Online ISBN: 978-3-540-37805-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation