ACM Home Page
Please provide us with feedback. Feedback
Compacting MIMOLA microcode
Full text PdfPdf (822 KB)
Source International Symposium on Microarchitecture archive
Proceedings of the 20th annual workshop on Microprogramming table of contents
Colorado Springs, Colorado, United States
Pages: 97 - 105  
Year of Publication: 1987
ISBN:0-89791-250-0
Authors
J. Bhasker  Honeywell Corporate Systems Development Division, 1000 Boone Avenue North, Golden Valley, MN
Tariq Samad  Honeywell Corporate Systems Development Division, 1000 Boone Avenue North, Golden Valley, MN
Sponsor
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/255305.255323
What is a DOI?

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 analyses 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 microword 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
AGER76
Agerwala, T. "Microprogram optimization: a survey", IEEE Trans. Computers, C-25, 10, Oct 1976, pp962-973.
 
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.
 
BHAS87
Bhasker, J., and Samad, T. "A better clique partitioning algorithm", in preparation.
 
DAS69
Das, S.R., and Sheng, C.L. "On finding maximal compatibles", Proc. IEEE, 57, April 1969, pp674-675.
 
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, pp845-848.
 
DASG76
Dasgupta, S., and Tartar, J. "The identification of maximal parallelism in straight line microprograms", IEEE Trans. Computers, C-25, 10, Oct 1976, pp986-992.
DASG79
 
GRAS70
Grasselli, A., and Montanari, U. "On the minimization of read-only memories in microprogrammed digital computers", IEEE Trans. Computers, C-19, 11, Nov 1970, pp1111-1114.
 
JAYA76
Jayasri, T., and Basu, D. "An approach to organizing microinstructions which minimizes the width of control store words", IEEE Trans. Computers, C-25, 5, May 1976, pp514-521.
 
MEAD80
 
MONT74
Montangero, C. "An approach to the optimal specification of read-only memories in microprogrammed digital computers", IEEE Trans. Computers, C-23, 4, April 1974, pp375-389.
 
NEWK83
Newkirk, J., and Mathews, R. The VLSI Designer's Library. Addison Wesley, 1983.
 
PENN72
Penny, W.M., and Lau, L. (Eds.) MOS Integrated Circuits, Chapter 7. Robert E. Krieger Publishing Company, Malabar, Florida, 1972.
 
RAMA74
Ramamoorthy, C.V., and Tsuchiya, M. "A highlevel language for horizontal microprogramming", IEEE Trans. Computers, C-23, 8, Aug 1974, pp791-801.
 
SAMA87
Samad, T., and Bhasker, J. "Some old and new results in clique partitioning", submitted for publication.
 
SCHW68
Schwartz, S.J. "An algorithm for minimizing read-only memories for machnie control", Proc. IEEE 10th Annual Symp. on Switching and Automata Theory, 1968, New York, pp28-33.
 
SYSL83
 
TSEN84
TSUC74
 
UNGE69
YAU74