Abstract
Micro-instruction generation for horizontally microprogrammable computers is examined in order to reduce the number of required micro-instructions for a loop-free segment of micro-operations. The micro-instruction generation process is analyzed and two optimization methods are presented. The first method is algorithmic in that it will always generate the minimum micro-instruction set for a given subblock of micro-operations. The other method is heuristic and does not always result in the minimum micro-instruction set. The methods are shown to achieve better results than those of the existing methods.
| Original language | English (US) |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Place of Publication | New York, NY |
| Publisher | ACM, Inc |
| Pages | 98-106 |
| Number of pages | 9 |
| State | Published - 1974 |
| Externally published | Yes |
| Event | Workshop on Microprogram, 7th Annu, Conf Rec, Prepr and Prepr Suppl - Palo Alto, CA, USA Duration: Sep 30 1974 → Oct 2 1974 |
Other
| Other | Workshop on Microprogram, 7th Annu, Conf Rec, Prepr and Prepr Suppl |
|---|---|
| City | Palo Alto, CA, USA |
| Period | 9/30/74 → 10/2/74 |
ASJC Scopus subject areas
- General Engineering
Fingerprint
Dive into the research topics of 'ON STORAGE OPTIMIZATION OF HORIZONTAL MICROPROGRAMS.'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS