COMPACTING MIMOLA MICROCODE.

J. Bhasker, Tariq Samad

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

The authors 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 to other similar tools, are discussed.

Original languageEnglish (US)
Title of host publicationMICRO
Subtitle of host publicationAnnual Microprogramming Workshop
PublisherACM
Pages97-105
Number of pages9
ISBN (Print)0897912500
StatePublished - Dec 1 1987

Fingerprint Dive into the research topics of 'COMPACTING MIMOLA MICROCODE.'. Together they form a unique fingerprint.

  • Cite this

    Bhasker, J., & Samad, T. (1987). COMPACTING MIMOLA MICROCODE. In MICRO: Annual Microprogramming Workshop (pp. 97-105). ACM.