Title :
Microcode Bit Optimization is NP-Complete
Author :
Robertson, Edward L.
Author_Institution :
Department of Computer Science, Indiana University
fDate :
4/1/1979 12:00:00 AM
Abstract :
The general problem of formatting microinstructions so as to minimize the width of words in control memory is shown to be computationally difficult. Hence, we should not attempt to solve the general case, but concentrate on heuristics for reasonable subcases.
Keywords :
Control memory; NP-completeness; microprogrammming; minimization; parallelism.; Computer science; Concurrent computing; Costs; Decoding; Encoding; Partitioning algorithms; Control memory; NP-completeness; microprogrammming; minimization; parallelism.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1979.1675353
