More Web Proxy on the site http://driver.im/

Article

Free access

Compacting MIMOLA microcode

Authors:

Tariq SamadAuthors Info & Claims

MICRO 20: Proceedings of the 20th annual workshop on Microprogramming

Pages 97 - 105

https://doi.org/10.1145/255305.255323

Published: 01 December 1987 Publication History

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

[1]

Agerwala, T. "Microprogram optimization: a survey", IEEE Trans. Computers, C-25, 10, Oct 1976, pp962-973.

Digital Library

[2]

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.

[3]

Bhasker, J., and Samad, T. "A better clique partitioning algorithm", in preparation.

[4]

Das, S.R., and Sheng, C.L. "On finding maximal compatibles", Proc. IEEE, 57, April 1969, pp674-675.

[5]

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.

Digital Library

[6]

Dasgupta, S., and Tartar, J. "The identification of maximal parallelism in straight line microprograms", IEEE Trans. Computers, C-25, 10, Oct 1976, pp986-992.

Digital Library

[7]

Dasgupta, S. "The organization of microprogram stores", Computing Surveys, Vol. 11, No. 1, March 1979, pp39-65.

Digital Library

[8]

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.

Digital Library

[9]

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.

Digital Library

[10]

Mead, C., and Conway, L. Introduction to VLSI Systems. Addison Wesley, 1980.

Digital Library

[11]

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.

Digital Library

[12]

Newkirk, J., and Mathews, R. The VLSI Designer's Library. Addison Wesley, 1983.

[13]

Penny, W.M., and Lau, L. (Eds.) MOS Integrated Circuits, Chapter 7. Robert E. Krieger Publishing Company, Malabar, Florida, 1972.

[14]

Ramamoorthy, C.V., and Tsuchiya, M. "A highlevel language for horizontal microprogramming", IEEE Trans. Computers, C-23, 8, Aug 1974, pp791-801.

Digital Library

[15]

Samad, T., and Bhasker, J. "Some old and new results in clique partitioning", submitted for publication.

[16]

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.

Digital Library

[17]

Syslo, M. M., N. Deo and J. S. Kowalski Discrete Optimization Algorithms with Pascal Programs, Prentice Hall Inc., Englewood Cliffs, NJ, 1983.

Digital Library

[18]

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.

Digital Library

[19]

Tsuchiya, M., and Gonzatez, M.J. "An approach to optimization of horizontal microprograms", Proc. 7th Annual Workshop on Microprogrammimg, ACM/IEEE, New York, 1977, pp92-108.

Digital Library

[20]

Unger, S.H. Asynchronous Sequential Switching Circuits, John Wiley & Sons Inc., New York, 1969.

Digital Library

[21]

Yau, S.S., Schowe, A.C., and Tsuchiya, M. "On storage optimization for horizontal microprograms", Proc. 7th Annual Workshop on Microprogramming, 1974, ACM/IEEE, New York, pp98-106.

Digital Library

Cited By

Sirisaengtaksin WGupta S(2002)Enhanced crosstalk fault model and methodology to generate tests for arbitrary inter-core interconnect topologyProceedings of the 11th Asian Test Symposium, 2002. (ATS '02).10.1109/ATS.2002.1181705(163-169)Online publication date: 2002
https://doi.org/10.1109/ATS.2002.1181705
Levia O(1989)Level synthesis approach to application-specific integrated circuits (ASIC) designProceedings., Second Annual IEEE ASIC Seminar and Exhibit10.1109/ASIC.1989.123164(T7-1/1-7)Online publication date: 1989
https://doi.org/10.1109/ASIC.1989.123164

Recommendations

Compacting MIMOLA microcode

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 ...
Experiments in Automatic Microcode Generation

A procedure is described which permits applications problems coded in a higher level language to be compiled to microcode for horizontally microprogrammed processors. An experimental language has been designed which is suitable for expressing ...
Some Experiments in Local Microcode Compaction for Horizontal Machines

Microcode compaction is an essential tool for the compilation of high-level language microprograms into microinstructions with parallel microoperations. The purpose of the research reported in this paper is to compare four microcode compaction methods ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

MICRO 20: Proceedings of the 20th annual workshop on Microprogramming

December 1987

174 pages

ISBN:0897912500

DOI:10.1145/255305

Chairman:
Gearold R. Johnson

Copyright © 1987 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1987

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 484 of 2,242 submissions, 22%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
150
Total Downloads

Downloads (Last 12 months)14
Downloads (Last 6 weeks)2

Reflects downloads up to 18 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Sirisaengtaksin WGupta S(2002)Enhanced crosstalk fault model and methodology to generate tests for arbitrary inter-core interconnect topologyProceedings of the 11th Asian Test Symposium, 2002. (ATS '02).10.1109/ATS.2002.1181705(163-169)Online publication date: 2002
https://doi.org/10.1109/ATS.2002.1181705
Levia O(1989)Level synthesis approach to application-specific integrated circuits (ASIC) designProceedings., Second Annual IEEE ASIC Seminar and Exhibit10.1109/ASIC.1989.123164(T7-1/1-7)Online publication date: 1989
https://doi.org/10.1109/ASIC.1989.123164

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents