Abstract
We address the problem of reducing the word length of microprograms. Two techniques are described: overlaying of fields and encoding of the microprogram. Formal analysis are presented of different encoding methods, assuming a VLSI implementation. A maximal encoding strategy appears to be the most area-efficient. Field overlaying is formulated as a clique-partitioning problem, and an efficient and practical clique-partitioning algorithm is presented. Based on these results, a microward compaction strategy that consists of field overlaying followed by maximal encoding has been implemented for the MIMOLA synthesis system (a design tool that generates excessively long microinstructions). Some considerations that are relevant to MIMOLA, and probably general to other similar tools, are discussed.
- AGER76 Agerwala, T. "Microprogram optimization: a survey", IEEE Trans, Computers, C-25, 10, Oct 1976, pp. 962--973.Google Scholar
Digital Library
- BAER77 Baer, J. L., and Koyama, B. On the minimization of the width of the control memory of microprogrammed processors, Tech. Rep. #77-08-01, Dept. Computer Science, Univ. of Washington, Seattle, 1977.Google Scholar
- BHAS87 Bhasker, J., and Samad, T. "A better clique partitioning algorithm", in preparation.Google Scholar
- DAS69 Das, S. R., and Sheng, C. L. "On finding maximal compatibles", Proc. IEEE, 57, April 1989, pp. 674--675.Google Scholar
- DAS73 Das, S. R., Banerji, D. K., and Chattopadhay, A. "On control memory minimization in microprogrammed digital computers", IEEE Trans. Computers, C-22, 9, Sept 1973, pp. 845--848.Google Scholar
Digital Library
- DASG76 Dasgupta, S., and Tartar, J. "The identification of maximal parallelism in straight line microprograms", IEEE Trans. Computers, C-25, 10, Oct 1976, pp. 986--992.Google Scholar
Digital Library
- DASG79 Dasgupta, S. "The organization of microprogram stores", Computing Surveys, Vol. 11, No. 1, March 1979, pp. 39--65. Google Scholar
Digital Library
- GRAS70 Grasselli, A. and Montanari, U., "On the minimization of read-only memory in microprogrammed digital computers", IEEE Trans. Computers, C-19, 11, Nov 1970, pp 1111--1114.Google Scholar
Digital Library
- JAYA78 T. Jayasri and D. Basu, "An approach to organizing microinstructions which minimizes the width of control store words," IEEE Trans. Computers, C-25, 5, May 1976, pp. 514--521.Google Scholar
Digital Library
- MEAD80 Mead, C., and Conway L., Introduction to VLSI Systems. Addison Wesley, 1980. Google Scholar
Digital Library
- MONT74 Montanegro, C. "An approach to the optimal specification of read-only memories in microprogrammed digital computers", IEEE Trans. Computers, C-23, 4, April 1974, pp 375--389.Google Scholar
Digital Library
- NEWK83 Newkirk, J., and Mathews, R. The VLSI Designer's Library. Addison Wesley, 1983.Google Scholar
- PENN72 Penny, W. M., and Lau, L. (Eds.) MOS Integrated Circuits, Chapter 7. Robert E, Krieger Publishing Company, Malabar, Florida, 1972.Google Scholar
- RAMA74 Ramamoorthy, C. V., and Tsuchiya, M. "A high-level language for horizontal microprogramming", IEEE Trans Computer, C-23, 8, Aug 1974, pp. 791--801.Google Scholar
Digital Library
- SAMA87 Samad, T., and Bhasker, J. "Some old and new results in clique partitioning", submitted for publication.Google Scholar
- SCHW68 Schwartz, S. J., "An algorithm for minimizing read-only memories for machine control". Proc. IEEE 10th Annual Symp. on Switching and Automata Theory, 1968, New York, pp 28--33.Google Scholar
Digital Library
- SYSL83 Syslo, M. M., N. Deo and J. S. Kowalski Discrete Optimization Algorithms with Pascal Programs, Prentice Hall Inc., Englewood Cliffs NJ. 1983. Google Scholar
Digital Library
- TSEN83 Tseng, C. J., Automated synthesis of data paths in digital systems, Ph.D. dissertation. Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, 1984. Google Scholar
Digital Library
- TSUC74 Tsuchiya M., and Gonzalez, M.J. "An approach to optimization of horizontal microprograms", Proc. 7th Annual Workshop on Microprogramming ACM/IEEE, New York, 1977. pp 92--108. Google Scholar
Digital Library
- UNGE69 Unger, S. H. Asynchronous Sequential Searching Circuits, John Wiley & Sons Inc., New York, 1969. Google Scholar
Digital Library
- YAU74 Yau, S. S., Schowe, A. C., and Tsuchiya, M. "On storage optimization for horizontal microprograms", Proc. 7th Annual Workshop on Microprogramming, 1971 ACM/IEEE, New York, pp. 98--106. Google Scholar
Digital Library
Index Terms
Compacting MIMOLA microcode
Recommendations
Compacting MIMOLA microcode
MICRO 20: Proceedings of the 20th annual workshop on MicroprogrammingWe address the problem of reducing the word length of microprograms. Two techniques are described: overlaying of fields and encoding of the microprogram. Formal analyses are presented of different encoding methods, assuming a VLSI implementation. A ...
The mimola design system: Tools for the design of digital processors
DAC '84: Proceedings of the 21st Design Automation ConferenceThe MIMOLA design method is a method for the design of digital processors from a very high-level bevavioral specification. A key feature of this method is the synthesis of a processor from a description of programs which are expected to be typical for ...
Compacting register file via 2-level renaming and bit-partitioning
A large multi-ported rename register file (RRF) is indispensable for simultaneous multithreaded (SMT) processors to hold more intermediate results of in-flight instructions from multiple threads running simultaneously. However, enlarging the RRF incurs ...






Comments