skip to main content
article
Free Access

An algorithm for global compaction of horizontal microprograms

Published:01 July 1986Publication History
Skip Abstract Section

Abstract

Compacting microoperations of a microprogram into horizontal microinstructions require an efficient global compaction algorithm. This paper describes a global compaction algorithm which is more practical than some of the existing techniques based on Tree compaction, Trace scheduling and generalized data dependency graph. The algorithm uses a local compaction technique in which the microoperation priority function is dynamically modified.

References

  1. A. V. Aho and J. D. Ullman, Principles of compiler design, Addison-wesly, Reading, Massachusetts 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. Landskov, S. Davidson, B. shriver and P. W. Mallet, "Local Microcode Compaction Techniques", ACM computing surveys vol.12(3) Sep.1980, pp 261--294. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Landskov, J. A. Fisher and B. D. Shriver, "Microcode compaction: Extending the boundaries", International Journal of computer and information sciences, vol. 13, No.1, 1984, pp 1--21.Google ScholarGoogle ScholarCross RefCross Ref
  4. J. A. Fisher, "The optimization of Horizontal microcode within and beyond basic blocks", Courant Math. and comput. Lab., New York Univ., Tech. Rep. C00-3077-161. oct 1979.Google ScholarGoogle Scholar
  5. J. A. Fisher, "Trace scheduling: A Technique for global microcode compaction", IEEE Trans. comput., vol. C-30, pp.478--490, july 1981.Google ScholarGoogle Scholar
  6. J. C. Atkins, "Tree compaction of microprograms", in proc. 16th Annu. Microprogramming Workshop, 1983, pp. 23--33.Google ScholarGoogle Scholar
  7. J. L. Linn, "SRDAG compaction - A generalization of Trace scheduling to increase the use of global context information", in proc. 16th Annu. microprogramming workshop, 1983, pp. 11--22.Google ScholarGoogle Scholar
  8. Knuth B. E, "An empirical study of Fortran programs", Software-practice & experience, 1, 1971, pp. 105--138.Google ScholarGoogle ScholarCross RefCross Ref
  9. M. Tokoro, E. Tamura and T. Takizuka, "Optimization of Microprograms", IEEE Trans. Comput. Vol c-30, No 7, July 1981, pp. 491--504.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. R. Grishman and S. Bogong, "A Preliminary Evaluation of Trace Scheduling for Global Microcode Compaction", Comp. Science Dept., New York Univ., Tech. Rep.043, May 1982.Google ScholarGoogle Scholar
  11. S. Dasgupta, "Parallelism in loop-free microprograms", in proc. IFIP congr., 1977, pp.745--750.Google ScholarGoogle Scholar
  12. S. Isoda, Y. Kobayashi and T. Tshida, "Global compaction of Horizontal Microprograms Based on the Generalized data depenency graph", IEEE Trans. Comput. Vol c-32, 10, Oct 1983, pp.922--933.Google ScholarGoogle Scholar
  13. S. Davidson, D. Landsokov, B. D. Shriver and P. W. Mallett, "Some experiments in local microcode compaction for horizontal machines", IEEE Trans. comput., Vol c-30, July 1981, pp.460--477.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. Upendra Rao and A. K. Majumdar, "An algorithm for local compaction of Horizontal Microprograms", Information processing letters 20, Jan 1985, pp.29--33. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Upendra Rao and A. K. Majumdar, "Analysis of a few List Scheduling Algorithms for compaction of Horizontal Microprograms", Microprocessing and Microprogramming, the Euromicro journal, Vol.17, No.1, Jan 1986, pp.29--40. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. T. Larsen, D. Landskov and B. D. Shriver, "A resource request model for microcode compaction", in proc. 16th Annu. Microprogramming Workshop, 1983, pp.215--226.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Tsuchiya M., Gonzalee M. J, "Towards optimization of Horizontal Microprograms", IEEE Trans. Comput. Vol c-25, 10, Oct 1976, pp.992--999.Google ScholarGoogle Scholar
  18. Wood, G, "On the packing of microoperations into microinstruction words", in proc. 11th Annu. Microprogramming Workshop, SIGMICRO News letter, 9, 4, pp.51--55, Dec 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Yau S. S, Schowe A. C and Tosuchiya M, "On storage optimization of horizontal microprograms", in proc. 7th Annu. Microprogramming Workshop, 1974, pp.98--106. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

(auto-classified)
  1. An algorithm for global compaction of horizontal 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 17, Issue 2
      July 1986
      25 pages
      ISSN:1050-916X
      DOI:10.1145/378397
      Issue’s Table of Contents

      Copyright © 1986 Authors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 July 1986

      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!