skip to main content
article
Free Access

A resource request model for microcode compaction

Authors Info & Claims
Published:01 December 1983Publication History
Skip Abstract Section

Abstract

A new approach to resource conflict analysis in microcode compaction has been developed. This paper begins with a description of the resource binding problem in microcode compaction and an analysis of earlier solutions. Then a new specification technique is presented and related to a standard problem in combinatorial theory. This new technique allows microoperations to be specified with resource choices, the actual binding to specific resources being delayed until compaction time. A polynomial-time algorithm for analyzing resource conflicts under this model is explained. Further extensions to the algorithm to support more complex machine models are suggested.

References

  1. BRUA77 Brualdi, R. A., Introductory Combinatorics, North-Holland, New York, 1977.Google ScholarGoogle Scholar
  2. COFF76 Coffman, E. G., Jr., ed., Computer and Job-Shop Scheduling Theory, New York: Wiley, 1976.Google ScholarGoogle Scholar
  3. DAVI81a Davidson, S., D. Landskov, B. D. Shriver, and P. W. Mallett, "Some experiments in local microcode compaction for horizontal machines," IEEE Trans, Comput. C-30, 7 (July 81), 460--477. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. DAVI81b Davidson, S., and B. D. Shriver, "Specifying target resources in a machine independent higher level language," in AFIPS Conf. Proc., Vol 50: 1981 National Computer Conf., AFIPS Press, Arlington, Va., 81--85.Google ScholarGoogle Scholar
  5. FISH81a Fisher, J. A., "Trace scheduling: a technique for global microcode compaction," IEEE Trans. Comput. C-30, 7 (July 81), 478--490. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. FISH81b Fisher, J. A., D. Landskov, and B. D. Shriver, "Microcode compaction: looking backward and looking forward," in AFIPS Conf. Proc., Vol 50: 1981 National Computer Conf., AFIPS Press, Arlington, Va., 95--102.Google ScholarGoogle Scholar
  7. LAND80 Landskov, D., S. Davidson, B. Shriver, and P. W. Mallett, "Local microcode compaction techniques," Comput. Surv., 12, 3 (Sept. 80), 261--294. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. LAWL76 Lawler, E. L., Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.Google ScholarGoogle Scholar
  9. MALL78 Mallett, P. W., "Methods of Compacting Microprograms," Ph.D. dissertation, Univ. of Southwestern Louisiana, Lafayette, Dec. 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. MEND70 Mendelson, E., Theory and Problems of Switching Circuits. Schaum's Outline Series. New York: McGraw-Hill, 1970.Google ScholarGoogle Scholar
  11. MIRS71 Mirsky, L., Transversal Theory, New York: Academic Press, 1971.Google ScholarGoogle Scholar
  12. PAPA82 Papadimitriou, C. H., and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Englewood Cliffs, NJ: Prentice Hall, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. VEGD82 Vegdahl, S. R., "Local Code Generation and Compaction in Optimizing Microcode Compilers," Ph.D. dissertation, Carnegie-Mellon Univ., Dec. 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. YAU74 Yau, S. S., A. C. Schowe, and M. Tsuchiya, "On storage optimization for horizontal microprograms," in Proc, 7th Annual Workshop on Microprogramming, ACM, IEEE, New York, 1974, 98--106. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

(auto-classified)
  1. A resource request model for microcode compaction

    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 4
      December 1983
      205 pages
      ISSN:1050-916X
      DOI:10.1145/1096419
      Issue’s Table of Contents

      Copyright © 1983 Authors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 December 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!