Microcode optimization with neural networks

IEEE Transactions on Neural Networks

Volumn 10, Issue 3, 1999, Pages 698-703

  Bharitkar, Sunil ^a   Tsuchiya, Kazuhiro ^b   Takefuji, Yoshiyasu ^c  

^a University of Southern California ^*  (United States)

^b FUJI ELECTRIC CO   (Japan)

^c KEIO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL COMPUTERS; GRAPH THEORY; MICROPROGRAMMING; OPTIMIZATION;

MICROCODE OPTIMIZATION; NEURAL NETWORK COST OPTIMIZER; NEURAL NETWORK MAXIMUM CLIQUE;

NEURAL NETWORKS;

EID: 0032656186     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/72.761728     Document Type: Article

References (34)

1. E. L. Robertson, "Microcode bit optimization is NP-complete," IEEE Trans. Comput., vol. C-28, pp. 316-319, Apr. 1979.
2. T. Agerwala, "Microprogram optimization: A survey," IEEE Trans. Comput., vol. C-25, pp. 962-973, Oct. 1978.
3. R. L. Kleir and C. V. Ramamoorthy, "Optimization strategies for microprograms," IEEE Trans. Comput., Special Issue on Microprogramming, vol. C-20, pp. 783-794, July 1971.
4. F. Astopas and K. I. Plukas, "Method of minimizing microprograms," Automat. Contr., vol. 5, no. 4, pp. 10-16, 1971.
5. C. V. Ramamoorthy and M. Tsuchiya, "A high level language for horizontal microprogramming," IEEE Trans. Comput., vol. C-23, pp. 791-801, Aug. 1974.
6. S. Dasgupta and J. Tartar, "The identification of maximum parallelism in straight line microprograms," IEEE Trans. Comput., vol. C-25, pp. 986-992, Oct. 1976.
7. M. Tokoro and E. Tamura, and T. Takizuka, "Optimization of microprograms," IEEE Trans. Comput., vol. C-30, pp. 491-504, July 1981.
8. S. Davidson, D. Landskov, B. D. Shnver, and P. W. Mallett, "Some experiments in local microcode compaction for horizontal machines," IEEE Trans. Comput., vol. C-30, pp. 460-477, July 1981.
9. J. A. Fisher, "Trace scheduling: A technique for global microcode compaction," IEEE Trans. Comput., vol. C-30, pp. 478-490, July 1981.
10. R. Puri and J. Gu, "Microword length minimization in microprogrammed controller synthesis," IEEE Trans. Computer-Aided Design, vol. 12, pp. 1449-1457, Oct. 1993.
11. I. C. Park, S. K. Hong, and C. M. Kyung, "Two complementary approaches for microcode bit optimization," IEEE Trans. Comput., vol. 43, pp. 234-239, Feb. 1994.
12. A. W. Nagle, R. Cloutier, and A. C. Parker, "Synthesis of hardware control of digital systems," IEEE Trans. Computer-Aided Dedign, vol. 1, pp. 201-212, Oct. 1982.
13. A. Shreshta, P. Kulshreshta, S. Kumar, and S. Ghose, "Automatic synthesis of microprogrammed control units from behaviorial descriptions," in Proc. 26th ACM/IEEE DAC Conf., 1989, pp. 147-154.
14. C. B. Silio, J. H. Pugsley, and B. A. Jeng "Control memory word width minimization using multiple valued circuits," IEEE Trans. Comput., vol. C-30, pp. 148-153, Feb. 1981.
15. T. Jayasri and D. Basu, "An approach to organizing microinstructions which minimizes the width of control store words," IEEE Trans. Comput., vol. C-25, pp. 514-521, May 1976.
16. J. P. Hayes, Computer Architecture. New York: McGraw-Hill, 1978.
17. J. Gu, S. S. Ravi, and S. H. O'Leary "Width minimization of microprograms through simulated annealing," Dept. Comput. Sci., State Univ. New York, Albany, Tech. Rep. TR-88-20, Aug. 1988.
18. S. J. Schwartz, "An algorithm for minimizing ROM memories for machine control," in Proc. IEEE 10th Annu. Symp. Switching Automata Theory, 1968, pp. 28-33.
19. V. M. Glushkov, "Minimization of microprograms and algorithm schemes," Kibernetika, 1966, pp. 1-3.
20. A. T. Mischenko, "The formal synthesis of an automaton by a microprogram-II," Kibernetika, vol. 4, pp. 21-27, 1968.
21. M. J. Flynn and R. F. Rosin, "Microprogramming: An introduction and viewpoint," IEEE Trans. Comput., vol. C-20, pp. 727-731, July 1971.
22. J. J. Hopfield and D. W. Tank, "Neural computation of desicions in optimization problems," Biol. Cybern., vol. 52, pp. 141-152, 1985.
23. Y. Takefuji and K-C. Lee, "Artificial neural networks for four-coloring and k-colorability problems," IEEE Trans. Neural Networks, vol. 38, pp. 326-333, 1991.
24. _, "A near optimum parallel planarization algorithm," Science, vol. 245, pp. 1221-1223, 1989.
25. K. Tsuchiya, S. Bharitkar, and Y. Takefuji, "A neural network approach to facility layout problems," European J. Operational Res., vol. 89, pp. 556-563, 1996.
26. N. Funabiki, Y. Takefuji, and K-C. Lee, "A neural network model for finding a near maximum clique," J. Parallel and Distributed Comput., vol. 14, 340-344, 1992.
27. B. Kamgar-Parsi and B. Kamgar-Parsi, "On problem solving with Hopfield neural networks," Biol. Cybern., vol. 62, pp. 467-483, 1990.
28. A. Hemani and A. Postula, "Cell placement by self organization" Neural Networks, vol. 3, 377-383, 1990.
29. M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness. New York: Freeman, 1979.
30. Y. Takefuji, K-C. Lee, and H. Aiso, "An artificial maximum neural network: A winner take all neuron model forcing the state of the system in a solution domain," Biol. Cybern., vol. 67, 243-251, 1992.
31. Y. Takefuji, Neural Network Parallel Computing. Boston: Kluwer, 1992.
32. M. Andrews, Principles of Firmware Engineering in Microprogram Control. Potomac, MD: Computer Sci. Press, 1980.
33. B. Su, S. Ding, J. Wang, and J. Xia, "Microcode compaction with timing constraints," in Proc. ACM/IEEE MICRO-20, 1987, pp. 59-68.
34. S. Husson, Microprogramming: Principles and Practices. Englewood Cliffs, NJ: Prentice-Hall, 1970.