Local Microcode Compaction Techniques
ACM Computing Surveys (CSUR)
Fundamentals of Computer Alori
Fundamentals of Computer Alori
MICRO 15 Proceedings of the 15th annual workshop on Microprogramming
MICRO 14 Proceedings of the 14th annual workshop on Microprogramming
Towards a microprogramming language schema
MICRO 11 Proceedings of the 11th annual workshop on Microprogramming
A machine independent approach to the production of optimized horizontal microcode.
A machine independent approach to the production of optimized horizontal microcode.
The optimization of horizontal microcode within and beyond basic blocks: an application of processor scheduling with resources
Design and construction of a virtual machine resource binding language
Design and construction of a virtual machine resource binding language
| Hi-index | 0.00 |
Microcode compaction is the process of converting essentially vertical microcode into horizontal microcode for a given architecture. The conventional plan calls for a microcode compiler to generate vertical code for a given architecture and then use a compaction system to produce horizontal code, thereby greatly reducing the complexity of horizontal code generation.This paper attempts to extend the existing techniques used to perform the compaction process. Specifically, the procedure presented generalizes the "trace scheduling" method of [Fisher81] by using more global context information in compaction decisions. A number of definitions from classical compaction are generalized to encompass this expanded scope.Further, the paper presents two example classes of problem for which the new method outperforms the trace scheduling technique in terms of the execution time efficiency of the generated code. A number of unresolved questions are noted involving the class of global compaction procedures.