Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

TST — An algorithm for global microcode compaction with timing constraints

  • 21 Accesses


Existing global microcode compaction approaches have all assumed a target architecture that has microoperation conflicts and data dependencies as the two fundamental compaction constraints. However, new practical micromachine features demand that the timing constraint be introduced into the traditional compaction model to guarantee compaction correctness. This paper starts by an analysis on the nature of timing constraints, then modifies the rules for microoperation motions, presents an algorithm, TST, based on Trace Scheduling, for global compaction under timing constraints, and finally shows results of experiments.

This is a preview of subscription content, log in to check access.


  1. [1]

    V. H. Allan, A Critical Analysis of the Global Optimization Problem for Horizontal Microcode. Ph. D. thesis, Colorado State University, Sept, 1986.

  2. [2]

    C. D. Ardoin, An Approach to Phase-Coupled Resource Allocation and Code Reorganization for a Class of Pipeline Architecture Ph. D. thesis. University of Southwestern Louisiana, Aug. 1986.

  3. [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.

  4. [4]

    J. A. Fisher, Trace scheduling: a technique for global microcode compaction.IEEE Trans. on Computers. C-30 (1981), 478–479.

  5. [5]

    T. R. Gross,et al., Optimizing Delayed Branches. Proc. of MICRO-15, 1982.

  6. [6]

    D. Landskov,et al., Local microcode compaction techniques.ACM Computing Surveys,12:3 (1980), 216–294.

  7. [7]

    L. Manasiev,et al., A Formal Approach to the Problems of Microcode Caused by Transient Data Resources of the Microarchitecture. Supplement of Proc. of MICRO-19, 1986.

  8. [8]

    R. A. Mueller, Horizon Compiler Hypothetical Micro-Architecture 2. Technical Report MAD-86-19, CSU, Sept. 1986.

  9. [9]

    B. Su, S. Ding and L. Jin, An Improvement of Trace Scheduling for Global Microcode Compaction and Its Implementation. Proc. of MICRO-17, 78–85, 1984.

  10. [10]

    B. Su and S. Ding, Some Experiments in Global Microcode Compaction, Proc. 18th Annual Workshop on Microprogramming, 175–180, Dec. 1985.

  11. [11]

    B. Su, S. Ding, and J. Xia, URPR — An Extension of URCR for Software Pipelining Proc. of MICRO-19, 94–103, Oct. 1986.

  12. [12]

    B. Su, S. Ding, J. Wang and J. Xia, Microcode compaction with Timing Constraints. Proc. of the 20th Annual Workshop on Microprogramming, 59–68, Dec. 1987.

  13. [13]

    Robert E. Tarjan, Shortest Path Algorithms in Graph Theory with Application to Algorithms and Computer Science. ed. by Y. Alavi, ete. JOHN WILET & SONS. Inc. 1985.

  14. [14]

    S. R. Vegdahl, Local Code Generation and Compaction in Optimizing Microcode Compilers, Ph. D. thesis. Carnegie-Mellon Univ., Dec. 1982.

  15. [15]

    Su Bogong, Wang Jian and Xia Jinshi, Global Microcode Compaction under Timing Constraints. In Proc. of 21st. Annual Workshop on Microprogramming, Dec. 1988.

  16. [16]

    Chen Bingcong, Yao Xin and Wei Xiaofan, Formal description of microoperations and its effect on automated microcode generation.Computer Research and Development (Chinese edition),22:9 (1986).

Download references

Author information

Correspondence to Bogong Su.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Su, B., Wang, J. & Xia, J. TST — An algorithm for global microcode compaction with timing constraints. J. of Compt. Sci. & Technol. 6, 97–107 (1991). https://doi.org/10.1007/BF02943413

Download citation


  • Compaction
  • Finite Timing
  • Basic Block
  • Global Compaction
  • Resource Conflict