Principles Firmware Engineering
Principles Firmware Engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Heuristics for the global optimization of microprograms
MICRO 13 Proceedings of the 13th annual workshop on Microprogramming
An approach to microprogram optimization considering resource occupancy and instruction formats
MICRO 10 Proceedings of the 10th annual workshop on Microprogramming
An approach to optimization of horizontal microprograms
MICRO 7 Conference record of the 7th annual workshop on Microprogramming
On storage optimization of horizontal microprograms
MICRO 7 Conference record of the 7th 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
Comments on "The Identification of Maximal Parallelism in Straight-Line Microprograms"
IEEE Transactions on Computers
IEEE Transactions on Computers
Some Experiments in Local Microcode Compaction for Horizontal Machines
IEEE Transactions on Computers
IEEE Transactions on Computers
Optimization Strategies for Microprograms
IEEE Transactions on Computers
A High-Level Language for Horizontal Microprogramming
IEEE Transactions on Computers
Microprogram Optimization: A Survey
IEEE Transactions on Computers
The Identification of Maximal Parallelism in Straight-Line Microprograms
IEEE Transactions on Computers
Toward Optimization of Horizontal Microprograms
IEEE Transactions on Computers
Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules
IEEE Transactions on Computers
The Consistent Labeling Problem: Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
The problem of compacting microcode has received considerable attention, but there remains much room for improvement. The major obstacle is the NP-completeness of the associated optimization problem and the coupling between code generation and compaction. Reduction operators are one form of heuristic technique that have been used effectively in scene analysis. By abstracting the microcode compaction problem as a constraint satisfaction problem, we can utilize some developed heuristic techniques. This approach is demonstrated along with experimental results obtained from a computer implementation. A comparison is made with several existing methods.