Skip to main content

Strategies for cache and local memory management by global program transformation

  • Session 4A: Compilers And Restructuring Techniques I
  • Conference paper
  • First Online:
Supercomputing (ICS 1987)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. J.R. Allen, “Dependence Analysis for Subscripted Variables and Its Application to Program Transformations,” Ph.D. Thesis, Rice University, Houston, Texas, April 1983.

    Google Scholar 

  2. J. Allen, and K. Kennedy, “A Parallel Programming Environment,” technical report, Rice COMP TR84-3, July 1984.

    Google Scholar 

  3. W. Abu-Sufah, D. Kuck and D. Lawrie, “Automatic Program Transformations for Virtual Memory Computers,” Proc. of the 1979 Nat'l Computer Conf., June, 1979, 969–974.

    Google Scholar 

  4. W. Abu-Sufah, D. Kuck and D. Lawrie, “On the Performance Enhancement of Paging Systems Through Program Analysis and Program Transformation,” IEEE Trans. Comp. V. C30 no. 5, May, 1981, pages 341–356.

    Google Scholar 

  5. M. Burke, R. Cytron, “Interprocedural Dependence Analysis and Parallelization,” Proc. Sigplan 86 Symposium on Compiler Construction, 21(7):162–175, July 1986.

    Google Scholar 

  6. Coffman, E., McKeller, “The organization of matricies and matrix operations in the paged multiprogramming environment,” CACM V. 12 pp. 153–165. March 1969.

    Google Scholar 

  7. W. Crowther, J. Goodhue, E. Starr, R Thomas, W. Milliken, T. Blackadar, "Performance Measurements on a 128-node Butterfly Parallel Processor," Proceedings of 1985 International Conference on Parallel Processing, pp. 531–540, 1985.

    Google Scholar 

  8. R. Cytron, “Compile-time Scheduling and Optimization for Asynchronous Machines,” Ph.D. Thesis, University of Illinois, Urbana-Champaign Aug., 1984 Report No. UIUCDCS-R-84-1177).

    Google Scholar 

  9. J. Ferante, K. Ottenstein, J. Warren, “The Program Dependence Graph and Its Uses in Optimization,” IBM Technical Report RC 10208, Aug. 1983.

    Google Scholar 

  10. Gannon, D., Jalby, W., “The Influence of Memory Heirarchy on Algorithm Organization: Programming FFTs on a Vector Multiprocessor,” to appear in “The Characteristics of Parallel Algorithms,” Gannon, Jamieson, Douglas, eds, MIT Press, 1987.

    Google Scholar 

  11. K. Kennedy, “Automatic translation of Fortran programs to vector form,” Rice Technical Report 476-029-4, Rice University, October 1980

    Google Scholar 

  12. D. Kuck, R. Kuhn, B. Leasure and M. Wolfe, “The Structure of an Advanced Vectorizer for Pipelined Processors,” IEEE Computer Society, proc. of the 4th Inter"l Computer Software and App. Conf., October, 1980, 709–715.

    Google Scholar 

  13. D. J. Kuck, R. H. Kuhn, B. Leasure, D. H. Padua and M. Wolfe, “Dependence graphs and compiler optimizations,” Conference Record of Eighth Annual ACM Symposium on Principles of Programming Languages, Williamsburg, VA., January 1981.

    Google Scholar 

  14. D. Kuck, M. Wolfe, and J. McGraw, “A Debate: Retire FORTRAN?,” Physics Today, May, 1984, 67–75.

    Google Scholar 

  15. D. Padua, “Multiprocessors: Discussion of Some Theoretical and Practical Problems,” Ph.D. Thesis, University of Illinois, Urbana-Champaign, Nov. 1979.

    Google Scholar 

  16. D. Padua and D. Kuck, “High-Speed Multiprocessors and Compilation Techniques,” IEEE Transactions on Computers, Vol. C-29, No. 9, September, 1980, 763–776.

    Google Scholar 

  17. D. Padua and M. Wolfe, “Advanced Compiler Optimizations for Supercomputers,” CACM, 29(12):1184–1201, Dec. 1986.

    Google Scholar 

  18. G. Phister, A. Norton, “Hot Spot Contention and Combining in Multistage Interconnection Networks,” Proceeding of the 1985 International Conference on Parallel Processing, 1985, 790–797.

    Google Scholar 

  19. C. Polychronopoulos, “On Program Restructuring, Scheduling, and Communication for Parallel Processor Systems,” Ph.D. Thesis, University of Illinois Center for Supercomputer Research and Development. CSRD TR.595, Aug. 1986.

    Google Scholar 

  20. Saraj, Sahni, “Approximate Algorithms for the 0,1 Knapsack Problem,” JACM V. 22 no. 1 pp 115–124.

    Google Scholar 

  21. Wang, K.-Y., Gannon, D., “Applying AI Techniques to Program Optimization for Parallel Computers,” To appear in “AI Machines and Supercomputer Systems”, Hwang, DeGroot, eds. McGraw Hill, 1987.

    Google Scholar 

  22. M. Wolfe, “Optimizing Supercompilers for Supercomputers,” Ph.D. Thesis, Dept. of Computer Science, University of Illinois, Urbana-Chanpaign, 1982, Report no. UIUCDCS-R-82-1105.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

E. N. Houstis T. S. Papatheodorou C. D. Polychronopoulos

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gannon, D., Jalby, W., Gallivan, K. (1988). Strategies for cache and local memory management by global program transformation. In: Houstis, E.N., Papatheodorou, T.S., Polychronopoulos, C.D. (eds) Supercomputing. ICS 1987. Lecture Notes in Computer Science, vol 297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18991-2_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-18991-2_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18991-6

  • Online ISBN: 978-3-540-38888-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics