Microcode Bit Optimization is NP-Complete

  • Authors:
  • E. L. Robertson

  • Affiliations:
  • Department of Computer Science, Indiana University

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1979

Quantified Score

Hi-index 14.98

Visualization

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.