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 been made so far to derive an algorithm for detection of microprogram parallelism to enable optimization of horizontal microprograms.
The storage requirement of a horizontal microprogram can be reduced by optimal packing of micro-operations into micro-instructions.The purpose of this paper is to examine micro-instruction generation for horizontally mieroprogrammable computers in order to reduce the number of required micro-instructions for a loop-free segment of micro-operations.Although some methods for solving this problem exist, so far no systematic approach has been used to determine what type of analysis must be performed on each sequential segment of micro-operations.In this paper, the micro-instruction generation process is analyzed and two optimization methods are presented.The first method is algorithmic in that it will always generate the minimum micro-instruction set for a given subblock of micro-operations.The other method is heuristic and does not always result in the minimum micro-instruction set.The methods developed here are shown to achieve better results than those of the existing methods.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.