skip to main content
article
Free Access

A new perspective on the classical microcode compaction problem

Published:01 March 1983Publication History
Skip Abstract Section

Abstract

Some comments are made concerning the generality and complexity of the classical microcode compaction problem. A trivial example is given that no classical compaction algorithm would compact optimally, because the computation of data precedence relations is dependent on the order of the source code. It is further argued that the classical compaction problem can be solved optimally in polynomial time, where the degree of the polynomial is dependent only on the micromachine architecture. We conclude that the most difficult portion of the microcode compaction problem is that of initially ordering the source code.

References

  1. {Fisher 79} Fisher, J. A. The Optimization of Horizontal Microcode Within and Beyond Basic Blocks: An Application of Processor Scheduling with Resources. PhD thesis, New York University, October, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. {Fisher 81} Fisher, J. A., Landskov, D. and Shriver, B. D. Microcode Compaction: Looking Backward and Forward. In Proc. 1981 National Computer Conference, pages 95--102. AFIPS, 1981.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. {Hillier 74} Hillier, F. S. and Lieberman, G. J. Introduction to Operations Research. Holden-Day, San Francisco, 1974. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. {Landskov 80} Landskov, D., Davidson, S., Shriver, B. and Mallett, P. W. Local Microcode Compaction Techniques. ACM Computing Surveys 12(3):261--294, September, 1980. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. {Mallett 78} Mallett, P. W. Methods of Compacting Microprograms. PhD thesis, University of Southwestern Louisiana, December, 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. {Poe 81} Poe, M. D., Goodell, R. and Steely, S. Jr. Issues of the Design of a Low Level Microprogramming Language for Global Microcode Compaction. In Proc. 14th Annual Workshop on Microprogramming, pages 88--94. IEEE, October, 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. {Vegdahl 82} Vegdahl, S. R. Local Code Generation and Compaction in Optimizing Microcode Compilers. PhD thesis, Carnegie-Mellon University, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. {Yau 74} Yau, S. S., Schowe, A. C. and Tsuchiya, M. On Storage Optimization of Horizontal Microprograms. In Proc. 7th Annual Workshop on Microprogramming, pages 98--106. IEEE, October, 1974. Google ScholarGoogle ScholarDigital LibraryDigital Library

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 14, Issue 1
    March 1983
    6 pages
    ISSN:1050-916X
    DOI:10.1145/1218033
    Issue’s Table of Contents

    Copyright © 1983 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 March 1983

    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!