Microcode compaction: looking backward and looking forward

  • Authors:
  • Joseph A. Fisher;David Landskov;Bruce D. Shriver

  • Affiliations:
  • Yale University, New Haven, Connecticut;University of Southwestern Louisiana, Lafayette, Louisiana;University of Southwestern Louisiana, Lafayette, Louisiana

  • Venue:
  • AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
  • Year:
  • 1981

Quantified Score

Hi-index 0.01

Visualization

Abstract

The past decade has seen significant advances in the state of the art in microcode compaction. Microprograms are compacted by placing several microoperations into each microinstruction, subject to the constraints of data dependency in the program and legal resource usage in the machine on which the microcode will execute. The compaction process attempts to make the code run as fast as possible. In this paper we will not only survey the most recent past in microcode compaction but will also speculate about the near future.