Microcode optimization with neural networks

Sunil Bharitkar, Kazuhiro Tsuchiya, Yoshiyasu Takefuji

Research output: Contribution to journalArticle

7 Citations (Scopus)

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 on the cost function. The latter method is then able to discover better solutions than other schemes for the benchmark data set.

Original languageEnglish
Pages (from-to)698-703
Number of pages6
JournalIEEE Transactions on Neural Networks
Volume10
Issue number3
DOIs
Publication statusPublished - 1999

Fingerprint

Firmware
Cost functions
Neural Networks
Neural networks
Cost Function
Maximum Clique
Optimization
Compatibility
Hopfield neural networks
Combinatorial optimization
Digital computers
Minimise
Hopfield Neural Network
Combinatorial Optimization Problem
Data storage equipment
NP-complete problem
Objective function
Optimise
Partition
Benchmark

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Electrical and Electronic Engineering
  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Hardware and Architecture

Cite this

Microcode optimization with neural networks. / Bharitkar, Sunil; Tsuchiya, Kazuhiro; Takefuji, Yoshiyasu.

In: IEEE Transactions on Neural Networks, Vol. 10, No. 3, 1999, p. 698-703.

Research output: Contribution to journalArticle

Bharitkar, Sunil ; Tsuchiya, Kazuhiro ; Takefuji, Yoshiyasu. / Microcode optimization with neural networks. In: IEEE Transactions on Neural Networks. 1999 ; Vol. 10, No. 3. pp. 698-703.
@article{aed148db0c044f02a23690ce44e8c215,
title = "Microcode optimization with neural networks",
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 on the cost function. The latter method is then able to discover better solutions than other schemes for the benchmark data set.",
author = "Sunil Bharitkar and Kazuhiro Tsuchiya and Yoshiyasu Takefuji",
year = "1999",
doi = "10.1109/72.761728",
language = "English",
volume = "10",
pages = "698--703",
journal = "IEEE Transactions on Neural Networks and Learning Systems",
issn = "2162-237X",
publisher = "IEEE Computational Intelligence Society",
number = "3",

}

TY - JOUR

T1 - Microcode optimization with neural networks

AU - Bharitkar, Sunil

AU - Tsuchiya, Kazuhiro

AU - Takefuji, Yoshiyasu

PY - 1999

Y1 - 1999

N2 - 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 on the cost function. The latter method is then able to discover better solutions than other schemes for the benchmark data set.

AB - 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 on the cost function. The latter method is then able to discover better solutions than other schemes for the benchmark data set.

UR - http://www.scopus.com/inward/record.url?scp=0032656186&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032656186&partnerID=8YFLogxK

U2 - 10.1109/72.761728

DO - 10.1109/72.761728

M3 - Article

C2 - 18252569

AN - SCOPUS:0032656186

VL - 10

SP - 698

EP - 703

JO - IEEE Transactions on Neural Networks and Learning Systems

JF - IEEE Transactions on Neural Networks and Learning Systems

SN - 2162-237X

IS - 3

ER -