Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Local Microcode Compaction Techniques
ACM Computing Surveys (CSUR)
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
Local code generation and compaction in optimizing microcode compilers
Local code generation and compaction in optimizing microcode compilers
Some Experiments in Local Microcode Compaction for Horizontal Machines
IEEE Transactions on Computers
Trace Scheduling: A Technique for Global Microcode Compaction
IEEE Transactions on Computers
| Hi-index | 0.00 |
A new approach to resource conflict analysis in microcode compaction has been developed. This paper begins with a description of the resource binding problem in microcode compaction and an analysis of earlier solutions. Then a new specification technique is presented and related to a standard problem in combinatorial theory. This new technique allows microoperations to be specified with resource choices, the actual binding to specific resources being delayed until compaction time. A polynomial-time algorithm for analyzing resource conflicts under this model is explained. Further extensions to the algorithm to support more complex machine models are suggested.