skip to main content
article
Free Access

Heuristics for the global optimization of microprograms

Published:30 November 1980Publication History
Skip Abstract Section

Abstract

Most of the discussion in the microprogram optimization literature deals only with straight line segments. This paper discusses an implementation in progress that globally optimizes microprograms. The complete optimization of microprograms has been shown to be very expensive computationally. However, the use of heuristics, such as those described in this paper, can efficiently approximate exhaustive optimization of microprograms.

References

  1. 1 Agerwala, T., Microprogram Optimization: A Survey, IEEE Transactions on Computers, Vol C-25, No. 10, October 1976, pages 962-973.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Aho, A. V., and Ullman, J. D., Principles of Compiler Design, Addison-Wesley, Reading, Massachusetts, 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Coffman, E. G. Jr. (Ed.), Computer and Job-Shop Scheduling Theory, John Wiley and Sons, N. Y., N. Y., 1976.Google ScholarGoogle Scholar
  4. 4 Dasgupta, S., Parallelism in Loop-Free Microprograms, in Information Processing '77, North-Holland, 1977, pages 745-750.Google ScholarGoogle Scholar
  5. 5 Dewitt, D. J., A Machine Independent Approach to the Production of Optimized Horizontal Microcode, Ph.D. Thesis, Department of Computer, Information, and Control Engineering, University of Michigan, June 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Fernandez, E. B., and Bussel, B., Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedule, IEEE Transactions on Computers, Vol C-22, No. 8, August 1973, pages 745-751.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Fisher, J. A., The Optimization of Horizontal Microcode Within and Beyond Basic Blocks: An Application of Processor Scheduling with Resources, Ph.D. Thesis, Department of Mathematics and Computing, New York University, October 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Foster, C. C., and Riseman, E. M., Percolation of Code to Enhance Parallel Dispatching and Execution, IEEE Transactions on Computers, Vol C-21, No. 12, December 1972, pages 1411-1415.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Gries, D., Compiler Construction for Digital Computers, John Wiley and Sons, N. Y., N. Y., 1971. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Hecht, M. S., Flow Analysis of Computer Programs, Elsevier North-Holland, N. Y., N. Y., 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Kleir, R. L., and Ramamoorthy, C. V., Optimization strategies for Microprograms, IEEE Transactions on Computers, Vol. C-20, No. 7, July 1971, pages 783-794.Google ScholarGoogle Scholar
  12. 12 Knuth, D. E., An Empirical Study of Fortran Programs, Software - Practice and Experience, Vol 1, 1971, pages 105-133.Google ScholarGoogle Scholar
  13. 13 Kuck, D. J., The Structure of Computers and Computations, Volume 1, John Wiley and Sons, New York, 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 Kuck, D. J. et. al., Measurements of Parallelism in Ordinary Fortran Programs, Computer, January 1974, pages 37-46.Google ScholarGoogle ScholarCross RefCross Ref
  15. 15 Kuck, D. J., Muraoka, Y., and Chen, S., On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup, IEEE Transactions on Computers, Vol C-21, No. 12, December 1972, pages 1293-1310.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16 Ma, Perng-Yi, Optimizing the Microcode Produced by a High Level Microprogramming Language, Ph.D. Thesis, Oregon State University, October 1978.Google ScholarGoogle Scholar
  17. 17 Mallett, P. W., Methods of Compacting Microprograms, Ph.D. Thesis, University of Southern Louisiana, December 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 Oakley, J. D., Symbolic Execution of Formal Machine Descriptions, Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, April 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19 Riseman, E. M., and Foster, C. C., The Inhibition of Potential Parallelism by Conditional Jumps, IEEE Transactions on Computers, Vol C-21, No. 12, December 1972.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20 Sager, D., Digital Equipment Corporation, private communication, 1980.Google ScholarGoogle Scholar
  21. 21 Ullman, J. D., Polynomical Complete Scheduling Problem, in Fourth Symposium Operating System Principles, 1973, pages 96-101. Published in Operating System Review, Vol. 7, No. 4, ACM, N. Y., cited in Fisher, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22 Wood, G., On the Packing of Micro-operations into Microinstruction Words, Proceedings of the 11th Annual Workshow on Microprogramming, ACM, November 1978, pages 41-50. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23 Wood, G., Global Optimization of Microprograms Through Modular Control Constructs, Proceedings of the 12th Annual Workshow on Microprogramming, ACM, November 1979, pages 1-6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. 24 Wulf, W., Johnson, R. K., Weinstock, C. B., Hobbs, S. O., Geschke, C. M., The Design of an Optimizing Compiler, Elsevier, New York, N. Y., 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Heuristics for the global optimization of microprograms

                    Recommendations

                    Comments

                    Login options

                    Check if you have access through your login credentials or your institution to get full access on this article.

                    Sign in

                    Full Access

                    • Published in

                      cover image ACM SIGMICRO Newsletter
                      ACM SIGMICRO Newsletter  Volume 11, Issue 3-4
                      Dec. 1980
                      177 pages
                      ISSN:1050-916X
                      DOI:10.1145/1014190
                      Issue’s Table of Contents

                      Copyright © 1980 Author

                      Publisher

                      Association for Computing Machinery

                      New York, NY, United States

                      Publication History

                      • Published: 30 November 1980

                      Check for updates

                      Qualifiers

                      • article

                    PDF Format

                    View or Download as a PDF file.

                    PDF

                    eReader

                    View online with eReader.

                    eReader
                    About Cookies On This Site

                    We use cookies to ensure that we give you the best experience on our website.

                    Learn more

                    Got it!