Microcode optimization with neural networks

被引:9
作者
Bharitkar, S [1 ]
Tsuchiya, K
Takefuji, Y
机构
[1] Univ So Calif, Dept Elect Engn Syst, Los Angeles, CA 90089 USA
[2] Fuji Elect Corp, Syst & Software Lab, Hino, Tokyo 191, Japan
[3] Keio Univ, Dept Environm Informat, Fujisawa, Kanagawa, Japan
来源
IEEE TRANSACTIONS ON NEURAL NETWORKS | 1999年 / 10卷 / 03期
关键词
microcode optimization; maximum clique; neural networks; NP-complete;
D O I
10.1109/72.761728
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:698 / 703
页数:6
相关论文
共 34 条
[1]  
AGERWALA T, 1978, IEEE T COMPUT, V25, P962
[2]  
ANDREWS M, 1980, PRINCIPLES FIRMWAVE
[3]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[4]  
ASTOPAS F, 1971, AUTOMAT CONTR, V5, P10
[5]  
DASGUPTA S, 1976, IEEE T COMPUT, V25, P986
[6]  
DAVIDSON S, 1981, IEEE T COMPUT, V30, P460, DOI 10.1109/TC.1981.1675826
[7]  
FISHER JA, 1981, IEEE T COMPUT, V30, P478, DOI 10.1109/TC.1981.1675827
[8]   MICROPROGRAMMING - INTRODUCTION AND A VIEWPOINT [J].
FLYNN, MJ ;
ROSIN, RF .
IEEE TRANSACTIONS ON COMPUTERS, 1971, C 20 (07) :727-&
[9]   A NEURAL NETWORK MODEL FOR FINDING A NEAR-MAXIMUM CLIQUE [J].
FUNABIKI, N ;
TAKEFUJI, Y ;
LEE, KC .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1992, 14 (03) :340-344
[10]  
GLUSHKOV VM, 1966, KIBERNETIKA, P1