skip to main content
article
Free Access

Microcode compaction with timing constraints

Published:01 June 1988Publication History
Skip Abstract Section

Abstract

At present, microcode compaction with timing constraints (abbreviated as MCTC) is still an open problem. Complex timing relation between microoperations greatly affects the optimization result of microcode. This paper begins with a survey of MCTC problems, then presents a formal description of MCTC and, on the basis of a systematic study of the characteristics of HCTC, presents a generally-oriented heuristic algorithm--CAS, which has a high success rate of scheduling and promises a good optimization result. Preliminary experiments indicate that CAS is better than other existing MCTC algorithms.

References

  1. V. H. Allen. A Critical Analysis of the Global Optimization Problem for Horizontal Microcode. Ph.D. thesis. Colorado State University. Sept. 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. D. Ardoin. An Approach to Phase-coupled Resource Allocation and Code Reorgenization for a Class of Pipeline Architecture. Ph.D. thesis. University of Southwestern Louisiana, Aug. 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. A. Fisher. The Optimization of Horizontal Microcode within and Beyond Basic Blocks: An Application of Processor Scheduling with Resources. U.S. Department of Energy Report. C00-3277-161. Oct. 1979.Google ScholarGoogle Scholar
  4. J. A. Fisher. Trace Scheduling: A Technique for Global Microcode Compection. IEEE Trans. on Computers. pp. 478--479, C-30, 1981.Google ScholarGoogle Scholar
  5. J. A. Fisher, et al. Microcode Compaction: Looking Backward and Looking Forward. National Computer Conference. 1981.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. O. Hoste, et al. Am29500 Application Note. AMD. Inc. 1985.Google ScholarGoogle Scholar
  7. T. R. Gross. et al. Optimizing Delayed Branches. Proc. of 15th Annual Workshop on Microprogramming (MICRO-15), 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. D. Landskov, et a1. Local Microcode Compaction Techniques. ACM Computing Surveys, pp. 216--294. Vol. 12. No. 3. Sept. 1980. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. D. Landskov. et al. Some Experiments in Local Microcode Compaction for Horizontal Machines. IEEE Trans. on Computers, Vol. C-30, July, 1981.Google ScholarGoogle Scholar
  10. L. Hanasiev. et al. A Formal approach to the Problems of Microcode Caused by Transient Data Resources of the Micro-architecture. SIGMICRO(l7-3) TCMICRO(1-3) NEWSLETTER. Dec. 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Mezzalana, et al. Microcode Compaction via Microblock Definition Proc. of the 15th Annual Workshop on Microprogramming (MICRO-15), 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. A. Mueller. Horizon Compiler Hypothetical Micro-Architecture 2. Technical Report MAD-86-19. CSU, Sept. 1986.Google ScholarGoogle Scholar
  13. M. D. Poe, et al. Issues of the Design of a Low Level Microprogramming Language to Global Microcode Compaction. Proc. of the 14th Annual Workshop on Microprogramming MICRO-14), pp. 88--94, Oct. 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. B. Su, S. Ding and L. Jin. An Improvement of Trace Scheduling for Global Microcode Compaction and Its Implementation. Proc. of the 17th Annual Workshop on Microprogramming (MICRO-17), pp. 78--85, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. B. Su. Basic Idea of Compaction Algorithm with Timing. Private communication, Aug. 1986.Google ScholarGoogle Scholar
  16. B. Su, S. Ding and J. Xia. URPR--An Extension of URCR for Sofware Pipelining. Proc. of the 19th Annual Workshop on Microprogramming (MICRO-19), Oct. 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Robert, E. Tarjan. Shortest Path Algorithms in "Graph Theory with Application to Algorithms and Computer Science, ed. by Y. Alavi, etc. John Vilet & Sons. Inc. 1985.Google ScholarGoogle Scholar

Index Terms

  1. Microcode compaction with timing constraints

            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 19, Issue 1-2
              June 1988
              66 pages
              ISSN:1050-916X
              DOI:10.1145/62197
              Issue’s Table of Contents

              Copyright © 1988 Authors

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 June 1988

              Check for updates

              Qualifiers

              • article
            • Article Metrics

              • Downloads (Last 12 months)15
              • Downloads (Last 6 weeks)1

              Other Metrics

            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!