Skip to main content
SpringerLink
Log in

Ein automatentheoretisches Modell einer Speicherhierarchie

  • Automatentheorie
  • Conference paper
  • First Online:
GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen

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

  • 1631 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. Mattson R.L.,u.a.: Evaluation Techniques for Storage Hierarchies, IBM Systems Journal, Vol. 9. 2, 1970

    Google Scholar 

  2. Belady L.A.: A Study of Replacement Algorithms for a Virtual Storage Computer, IBM Systems Journal, Vol. 5. 2, 1966

    Google Scholar 

  3. Aho A.V., Denning P.J., Ullman J.D.: Principles of Optimal Page Replacement, JACM, Vol. 18. 1, 1971

    Google Scholar 

  4. Hatfield D.J., Gerald J.: Program Restructuring for Virtual Memory, IBM Systems Journal, Vol. 10. 3, 1971

    Google Scholar 

Download references

Authors
  1. H. -G. Stork
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag

About this paper

Cite this paper

Stork, H.G. (1973). Ein automatentheoretisches Modell einer Speicherhierarchie. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039143

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06527-2

  • Online ISBN: 978-3-540-37826-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation