Skip to main content
SpringerLink
Log in

Zur Verbesserung Des Lokalitätsverhaltens Von Programmen Durch Optimale Zerlegung Des Programmgraphen

  • Conference paper
Book cover GI — 9. Jahrestagung

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

  • 61 Accesses

Zusammenfassung

Reale Programme erfüllen oft nicht die Annahmen über ihr Referenzverhalten im Adreßraum wie sie den meisten Modellen über das Programmverhalten im virtuellen Speicher mit Seiteneinteilung zugrunde liegen. Durch Lösung eines Graphenzerlegungsproblems wird ein exaktes Verfahren angegeben, nach dem die Programmteile im Adreßraum zu plazieren sind, so daß ein besseres Referenzverhalten zu erwarten ist.

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

Access this chapter

Log in via an institution
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.

Literatur

  1. J. Y. BABONNEAU et al.: “Automatic and General Solution to the Adaptation of Programs in a Paging Environment„ Proc. 6 ACM Symp. on Operating System Princ., 1977, S. 109–116

    Google Scholar 

  2. J.-L. BAER, R. CAUGHEY: “Segmentation and Optimization of Programs from Cyclic Structure Analysis„ Proc. AFIPS Spring Joint Computer Conference, 1972, S. 23–35

    Google Scholar 

  3. E. G. COFFMAN, P. J. DENNING: “Operating Systems Theory„ Prentice-Hall, 1973

    Google Scholar 

  4. E. G. COFFMAN, J. Y.-T. LEUNG: “Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation„ Proc. 18th Ann. Symp. on Found. of Comp. Sc, 1977, S. 214–221

    Google Scholar 

  5. D. FERRARI: “Improving Program Locality by Strategy-oriented Restructuring„, IFIP 1974, S. 266–270

    Google Scholar 

  6. D. FERRARI: “Improving Locality by Critical Working Sets„ CACM, 17 (1974), S. 614–620

    MATH  Google Scholar 

  7. D. J. HATFIELD, J. GERALD: “Program Restructuring for Virtual Memory„, IBM Syst. J., 10 (1971), S. 168–192

    Article  Google Scholar 

  8. M. S. HECHT: “Flow Analysis of Computer Programs„ North-Holland Publ. Co., 1977

    MATH  Google Scholar 

  9. E. W. VER HOEF: “Automatic Program Segmentation Based on Boolean Connectivity„ Proc. AFIPS Spring Joint Computer Conference, 1971, S. 491–495

    Google Scholar 

  10. OS/370 PL1 Optimizing Compiler: Programmer’s Guide International Business Machines Co., SC33-0006–3, 1974

    Google Scholar 

  11. J. S. LIPTAY: “Structural Aspects of the System/360 Model 85, II: The Cache„, IBM Syst. J., 7 (1968), S. 15–21

    Article  Google Scholar 

  12. T. C. LOWE: “Analysis of Boolean Program Models for Time-Shared, Paged Environments„, CACM, 12 (1969), S. 199–205

    MATH  Google Scholar 

  13. T. C. LOWE: “Automatic Segmentation of Cyclic Program-Structures Based on Connectivity and Processor Timing„ CACM, 13 (1970), S. 3–6

    Google Scholar 

  14. T. C. LOWE: “Automatic Segmentation of Cyclic Program-Structures Based on Connectivity and Processor Timing„ CACM, 13 (1970), S. 9

    Google Scholar 

  15. J. A. LUKES: “Combinatorial Solution for the Partitioning of General Graphs„, IBM J. Res. & Devel., 19 (1975), S. 170–180

    Article  MathSciNet  MATH  Google Scholar 

  16. T. MASUDA et al.: “Optimization of Program Organization by Cluster Analysis„, IFIP 1974, S. 261–265

    Google Scholar 

  17. H. AN DE MEULEN: “Strategien zur Verwaltung des Speicherraums von SIMULA-Programmen in einer Paging-Umgebung„ Universität Bonn, Inst. f. Informatik, Dipl.arbeit, 1978

    Google Scholar 

  18. C. V. RAMAMOORTHY: “The Analytic Design of a Dynamic Look-Ahead and Program Segmenting System for Multiprogrammed Computers„ Proc. 21st ACM Computer Conf., 1966, S. 229–239

    Google Scholar 

  19. J. G. ROGERS: “Structured Programming for Virtual Storage Systems„, IBM Syst. J., 14 (1975), S. 385–406

    Article  MATH  Google Scholar 

  20. U. SCHINDLER: “Die Segmentierung von FORTRAN-Programmen„ Universität Bonn, Inst. f. Informatik, Dipl.arbeit, 1978

    Google Scholar 

  21. W. SCHRÖCK: “Konstruktion optimaler Zerlegungen endlicher Graphen mit gewichteten Knoten und Kanten„ Universität Bonn, Inst. f. Informatik, Informatik-Bericht Nr. 27 1979

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Bonn, 5300, Bonn, Deutschland

    Werner Schröck

Authors
  1. Werner Schröck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Bonn, Wegelerstr. 6, 5300, Bonn, Deutschland

    K. H. Böhling  & P. P. Spies  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Schröck, W. (1979). Zur Verbesserung Des Lokalitätsverhaltens Von Programmen Durch Optimale Zerlegung Des Programmgraphen. 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_34

Download citation

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

  • 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

Search

Navigation