Abstract
A new algorithm to allocate horizontal microprograms having many addressing restrictions is presented in this note. This algorithm, using simultaneous partitioning, sufficiently maximizes the microprogram performance and minimizes the necessary memory amount in practical use.
- 1 J.F. Wakerly et al. "Placement of Microinstruction in a Two-Dimensional Address Space", MICRO-8 (1975) pp46-51 Google Scholar
Digital Library
- 2 T.G. Szymanski "Assembling Code for Machines with Span-Dependent Instructions", Comm. ACM 21, 4 (1978) pp300-308 Google Scholar
Digital Library
Index Terms
Proposal on efficient address allocation algorithm for horizontal microprograms
Recommendations
Toward Optimization of Horizontal Microprograms
Detection of concurrently executable microoperations is an important consideration for effective horizontal microprogramming. Since it is highly machine-dependent and requires knowledge of highly intricate features of a machine, only limited effort has ...
Proposal on efficient address allocation algorithm for horizontal microprograms
MICRO 11: Proceedings of the 11th annual workshop on MicroprogrammingA new algorithm to allocate horizontal microprograms having many addressing restrictions is presented in this note. This algorithm, using simultaneous partitioning, sufficiently maximizes the microprogram performance and minimizes the necessary memory ...
An approach to optimization of horizontal microprograms
MICRO 7: Conference record of the 7th annual workshop on MicroprogrammingDetection of concurrently executable microoperations is an important consideration for effective horizontal microprogramming. Since it is highly machine-dependent and requires knowledge of highly intricate features of a machine, only limited effort has ...






Comments