Improved instruction formation in the exhaustive local microcode compaction algorithm

Abstract

An algorithm has been developed to compact the micro-operations of horizontal microcode into optimal segments of straight-line microinstructions. The Quine modified (QM) algorithm generates solutions for 24 micro-operations in 2 sec. of VAX processing time. It generates a small number of solutions. A Pascal program that models the algorithm has been developed. A proof that the algorithm produces a minimal solution is given.