Automated microcode synthesis
Local Microcode Compaction Techniques
ACM Computing Surveys (CSUR)
A unifying approach to scheduling
Communications of the ACM
Graph Algorithms
Combinatorial Algorithms: For Computers and Hard Calculators
Combinatorial Algorithms: For Computers and Hard Calculators
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Towards an efficient, machine-independent language for microprogramming
MICRO 12 Proceedings of the 12th 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 representation for the analysis of microprogram operation
MICRO 7 Conference record of the 7th annual workshop on Microprogramming
A technique of global optimization of microprograms
MICRO 11 Proceedings of the 11th annual workshop on Microprogramming
On the packing of micro-operations into micro-instruction words
MICRO 11 Proceedings of the 11th annual workshop on Microprogramming
A Control Word Model for detecting conflicts between microprograms
MICRO 8 Proceedings of the 8th annual workshop on Microprogramming
High-level microprogramming: an optimizing C compiler for a processing element of a CAD accelerator
MICRO 23 Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture
| Hi-index | 0.00 |
An algorithm has been developed to compact the micro-operations of horizontal microcode into optimal segments of straight-line microinstructions. The Quine modified (QM) algorithm generates solutions for 24 micro-operations in 2 sec. of VAX processing time. It generates a small number of solutions. A Pascal program that models the algorithm has been developed. A proof that the algorithm produces a minimal solution is given.