MICROCODE COMPACTION WITH TIMING CONSTRAINTS.

Abstract

At present, microcode compaction with timing constraints (MCTC) is still an open problem. The complex timing relation between microoperations greatly affects the optimization of microcode. The authors survey MCTC problems, present a formal description of MCTC, and present a general heuristic algorithm, CAS, which has a high success rate for scheduling and promises a good optimization result. Preliminary experiments indicate that CAS is better than other existing MCTC algorithms.