Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
Local Microcode Compaction Techniques
ACM Computing Surveys (CSUR)
Issues of the design of a low level microprogramming language for global microcode compaction
MICRO 14 Proceedings of the 14th annual workshop on Microprogramming
On storage optimization of horizontal microprograms
MICRO 7 Conference record of the 7th annual workshop on Microprogramming
Methods of compacting microprograms
Methods of compacting microprograms
The optimization of horizontal microcode within and beyond basic blocks: an application of processor scheduling with resources
Local code generation and compaction in optimizing microcode compilers
Local code generation and compaction in optimizing microcode compilers
| Hi-index | 0.00 |
Some comments are made concerning the generality and complexity of the classical microcode compaction problem. A trivial example is given that no classical compaction algorithm would compact optimally, because the computation of data precedence relations is dependent on the order of the source code. It is further argued that the classical compaction problem can be solved optimally in polynomial time, where the degree of the polynomial is dependent only on the micromachine architecture. We conclude that the most difficult portion of the microcode compaction problem is that of initially ordering the source code.