Title :
On the Minimization of the Width of the Control Memory of Microprogrammed Processors
Author :
Baer, Jean-Loup ; Koyama, Barbara
Author_Institution :
Department of Computer Science, University of Washington
fDate :
4/1/1979 12:00:00 AM
Abstract :
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.
Keywords :
Branch and bound algorithm; NP-complete.; bin packing; control store width; microprogramming; near-optimal solutions; Automatic control; Computer aided manufacturing; Computer science; Concurrent computing; Design optimization; Digital control; Engines; Laboratories; Microprogramming; Read only memory; Branch and bound algorithm; NP-complete.; bin packing; control store width; microprogramming; near-optimal solutions;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1979.1675352