Optimization of Microprograms

Abstract

This paper describes a microprogram optimization technique called MORIF. The technique is general enough to treat machines whose microoperations require multiple machine cycles on a subcycle basis. The technique is applicable to microinstruction formats varying from horizontal to partially encoded, and to vertical. The technique includes global optimization algorithms for microprograms containing loops and recursive subroutines. Evaluation of the technique is performed from both the viewpoints of the complexity of the devised algorithms, and efficiency of generated object microcodes.