A resource request model for microcode compaction
Tore Larsen, David Landskov, Bruce D. Shriver · ACM SIGMICRO newsletter/SIGMICRO newsletter/SIGMICRO, TCMICRO newsletter · 1983
A new approach to resource conflict analysis in microcode compaction has been developed. This paper begins with a description of the resource binding problem in microcode compaction and an analysis of earlier solutions. Then a new specification technique is presented and related to a standard problem in combinatorial theory. This new technique allows microoperations to be specified with resource choices, the actual binding to specific resources being delayed until compaction time. A polynomial-time algorithm for analyzing resource conflicts under this model is explained. Further extensions to the algorithm to support more complex machine models are suggested.
Cited by 1 works. doi:10.1145/1096419.1096451 Open-access PDF
Authors
References
- Combinatorial optimization: networks and matroids
- Combinatorial optimization:Algorithms and complexity
- Computer and job-shop scheduling theory
- Trace Scheduling: A Technique for Global Microcode Compaction
- Local Microcode Compaction Techniques
- Some Experiments in Local Microcode Compaction for Horizontal Machines
- Methods of compacting microprograms
- Microcode compaction
- On storage optimization of horizontal microprograms
- Local Code Generation and Compaction in Optimizing Microcode Compilers