Microcode compaction
Joseph A. Fisher, David Landskov, Bruce D. Shriver · AFIPS National Computer Conference (NCC) · 1981
The past decade has seen significant advances in the state of the art in microcode compaction. Microprograms are compacted by placing several microoperations into each microinstruction, subject to the constraints of data dependency in the program and legal resource usage in the machine on which the microcode will execute. The compaction process attempts to make the code run as fast as possible. In this paper we will not only survey the most recent past in microcode compaction but will also speculate about the near future.
Cited by 49 works. doi:10.1145/1500412.1500426
Authors
References
- Principles of Compiler Design
- Trace Scheduling: A Technique for Global Microcode Compaction
- Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
- The Inhibition of Potential Parallelism by Conditional Jumps
- High-Speed Multiprocessors and Compilation Techniques
- Local Microcode Compaction Techniques
- Some Experiments in Local Microcode Compaction for Horizontal Machines
- Optimization of horizontal microcode within and beyond basic blocks: an application of processor scheduling with resources
- The Organization of Microprogram Stores
- Methods of compacting microprograms