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.
- V. H. Allen. A Critical Analysis of the Global Optimization Problem for Horizontal Microcode. Ph.D. thesis. Colorado State University. Sept. 1986. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- J. A. Fisher. Trace Scheduling: A Technique for Global Microcode Compection. IEEE Trans. on Computers. pp. 478--479, C-30, 1981.Google Scholar
- J. A. Fisher, et al. Microcode Compaction: Looking Backward and Looking Forward. National Computer Conference. 1981.Google Scholar
Digital Library
- O. Hoste, et al. Am29500 Application Note. AMD. Inc. 1985.Google Scholar
- T. R. Gross. et al. Optimizing Delayed Branches. Proc. of 15th Annual Workshop on Microprogramming (MICRO-15), 1982. Google Scholar
Digital Library
- D. Landskov, et a1. Local Microcode Compaction Techniques. ACM Computing Surveys, pp. 216--294. Vol. 12. No. 3. Sept. 1980. Google Scholar
Digital Library
- D. Landskov. et al. Some Experiments in Local Microcode Compaction for Horizontal Machines. IEEE Trans. on Computers, Vol. C-30, July, 1981.Google Scholar
- 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 Scholar
Digital Library
- M. Mezzalana, et al. Microcode Compaction via Microblock Definition Proc. of the 15th Annual Workshop on Microprogramming (MICRO-15), 1982. Google Scholar
Digital Library
- R. A. Mueller. Horizon Compiler Hypothetical Micro-Architecture 2. Technical Report MAD-86-19. CSU, Sept. 1986.Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- B. Su. Basic Idea of Compaction Algorithm with Timing. Private communication, Aug. 1986.Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Index Terms
Microcode compaction with timing constraints
Recommendations
Microcode compaction with timing constraints
MICRO 20: Proceedings of the 20th annual workshop on MicroprogrammingAt 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 ...
Global microcode compaction under timing constraints
MICRO 21: Proceedings of the 21st annual workshop on Microprogramming and microarchitectureExisting global microcode compaction algorithms have all been based on the assumption that the parallelism exploitation is constrained only by data dependency and resource limitation. However, the timing constraint also has great impact upon microcode ...
Compaction with General Synchronous Timing
In current microcode generation systems, one simplification that is frequently made is to assume an absence of timing restrictions. It is critical that timing is considered when the target architecture involves branch delays, volatile registers, or ...






Comments