All example of using pseudofields to eliminate version shuffling in horizontal code compaction

Authors:
J. L. Linn;C. D. Ardoin
Affiliations:
Institute for Defense Analyses, Alexandria, Virginia;Institute for Defense Analyses, Alexandria, Virginia
Venue:
MICRO 22 Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture
Year:
1989

Citing 3
Cited 1

Lazy data routing and greedy scheduling for application-specific signal processors

MICRO 21 Proceedings of the 21st annual workshop on Microprogramming and microarchitecture
Fundamentals of Computer Alori

Fundamentals of Computer Alori
Local code generation and compaction in optimizing microcode compilers

Local code generation and compaction in optimizing microcode compilers

Generating compilers for generated datapaths

EURO-DAC '94 Proceedings of the conference on European design automation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper first reviews the version shuffling problem for microcode compaction. Next, a somewhat representative compaction problem involving asymmetric ALUs and a port-limited register file is presented. Finally, the paper shows how to model the architecture in a microcode compiler using the concept of pseudofields. While the modeling process is nontrivial, it is seen that this approach solves the version shuffling problem without introducing early-binding inefficiencies in the compiled code.