1990
DOI: 10.1016/0141-9331(90)90010-s
|View full text |Cite
|
Sign up to set email alerts
|

Automatic compaction of microcode

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1997
1997
1997
1997

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…Lioy and Mezzalama [71] have approached the compaction problem by defining pseudo micro-instructions and sequences of micro-operations with source and destination properties. These sequences can then be packed into and upward past pseudo micro-instructions to form real micro-instructions.…”
Section: Microcode Compactionmentioning
confidence: 99%
“…Lioy and Mezzalama [71] have approached the compaction problem by defining pseudo micro-instructions and sequences of micro-operations with source and destination properties. These sequences can then be packed into and upward past pseudo micro-instructions to form real micro-instructions.…”
Section: Microcode Compactionmentioning
confidence: 99%
“…For example, the ALU and the ACU can work in parallel if they do not occupy the data bus at the same time. The instruction format provides orthogonal fields for parallel operations, so that compaction is rather straightforward [14]. However, there are cases where data-flow optimizations must be performed in order to best exploit the available parallelism.…”
Section: Data-flow Optimizationmentioning
confidence: 99%