An algorithm for local compaction of horizontal microprograms
Information Processing Letters - The British Computer Society workshop series
Analysis of a few list scheduling algorithms for compaction of horizontal microprograms
Microprocessing and Microprogramming
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
On the packing of micro-operations into micro-instruction words
MICRO 11 Proceedings of the 11th annual workshop on Microprogramming
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
The trap as a control flow mechanism
MICRO 21 Proceedings of the 21st annual workshop on Microprogramming and microarchitecture
| Hi-index | 0.00 |
Compacting microoperations of a microprogram into horizontal microinstructions require an efficient global compaction algorithm. This paper describes a global compaction algorithm which is more practical than some of the existing techniques based on Tree compaction, Trace scheduling and generalized data dependency graph. The algorithm uses a local compaction technique in which the microoperation priority function is dynamically modified.