Microcode optimization with neural networks

  • Authors:
  • S. Bharitkar;K. Tsuchiya;Y. Takefuji

  • Affiliations:
  • Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA;-;-

  • Venue:
  • IEEE Transactions on Neural Networks
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Microcode optimization is an NP-complete combinatorial optimization problem. This paper proposes a new method based on the Hopfield neural network for optimizing the wordwidth in the control memory of a microprogrammed digital computer. We present two methodologies, viz., the maximum clique approach, and a cost function based method to minimize an objective function. The maximum clique approach albeit being near O(1) in complexity, is limited in its use for small problem sizes, since it only partitions the data based on the compatibility between the microoperations, and does not minimize the cost function. We thereby use this approach to condition the data initially (to form compatibility classes), and then use the proposed second method to optimize the cost function. The latter method is then able to discover better solutions than other schemes for the benchmark data set