heuristics for the global optimization of microprograms
Most of the discussion in the microprogram optimization literature deals only with straight line segments. This paper discusses an implementation in progress that globally optimizes microprograms. The complete optimization of microprograms has been shown to be very expensive computationally. However, the use of heuristics, such as those described in this paper, can efficiently approximate exhaustive optimization of microprograms.
heuristics global optimization optimality microprogramming segmentation paper implementation completeness use approximation