Issue No.04 - April (1979 vol.28)
J.-L. Baer , Department of Computer Science, University of Washington
A branch and bound method to minimize the width of the control memory of microprogrammed processors is given. Although it is exponential in the worst case, it appears much more effective than previous enumerative solutions. Furthermore, it can lead quickly to near-optimal solutions representing "good engineering" reductions.
NP-complete., Branch and bound algorithm, bin packing, control store width, microprogramming, near-optimal solutions
J.-L. Baer, B. Koyama, "On the Minimization of the Width of the Control Memory of Microprogrammed Processors", IEEE Transactions on Computers, vol.28, no. 4, pp. 310-316, April 1979, doi:10.1109/TC.1979.1675352