Local Microcode Compaction Techniques
ACM Computing Surveys (CSUR)
Some Aspects of High-Level Microprogramming
ACM Computing Surveys (CSUR)
Microprogrammable Computer Architectures
Microprogrammable Computer Architectures
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
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
On the packing of micro-operations into micro-instruction words
MICRO 11 Proceedings of the 11th annual workshop on Microprogramming
Towards a microprogramming language schema
MICRO 11 Proceedings of the 11th 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.
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
The trap as a control flow mechanism
MICRO 21 Proceedings of the 21st annual workshop on Microprogramming and microarchitecture
Compaction of two-level microprograms for a multiprocessor computer
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
| Hi-index | 0.00 |
Much work has been done recently on the problem of compaction of microcode, that of detecting parallelism between microoperations expressed in a sequential manner in order to pack the operations into as few microinstructions as possible. In particular, the theory of local compaction has developed to the stage where some extensive testing of the models and methods is called for. This paper examines some of the considerations for local compaction of the nanocode of the Nanodata QM-1 in the context of the theoretical model of compaction presented in the literature. This application of compaction to QM-1 nanocode not only provides a stringent test of the model, but also shows that compaction of code for this architecture is feasible, thus forming part of a test of the practicalities of developing a high-level microprogramming language for the QM-1.