HMO, a hardware microcode optimizer

Abstract

This paper discusses an algorithm for optimizing the density and parallelism of microcoded routines in microprogrammable machines.Besides the algorithm itself, the algorithm's uses, adaptability to conventional machine characteristics, and architectural requirements are also discussed and analyzed. Even though the paper proposes a hardware implementation of the algorithm, the algorithm is viewed as an integral part of the entire microcode generation and usage process, from initial high-level input into a software microcode compiler down to machine-level execution of the resultant microcode on the host machine. It is believed that, by removing much of the traditionally time-consuming and machinedependent microcode optimization from the software portion of this process, the algorithm can improve the overall process.

Study and Experimentation of Horizontal Microprocessor Machine Description Techniques

“…The T set represents the time increments in which the E set is active. Time increments are [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18] JRS arbitrarily defined to be 1 nanosecond per increment. The T set for a MOP thus represents the contiguous time intervals, within the cycle, during which the (i).…”