Optimization of Microprograms
- 1 July 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-30 (7) , 491-504
- https://doi.org/10.1109/tc.1981.1675828
Abstract
This paper describes a microprogram optimization technique called MORIF. The technique is general enough to treat machines whose microoperations require multiple machine cycles on a subcycle basis. The technique is applicable to microinstruction formats varying from horizontal to partially encoded, and to vertical. The technique includes global optimization algorithms for microprograms containing loops and recursive subroutines. Evaluation of the technique is performed from both the viewpoints of the complexity of the devised algorithms, and efficiency of generated object microcodes.Keywords
This publication has 28 references indexed in Scilit:
- Local Microcode Compaction TechniquesACM Computing Surveys, 1980
- A practical interprocedural data flow analysis algorithmCommunications of the ACM, 1978
- On Live-Dead Analysis for Global Data Flow ProblemsJournal of the ACM, 1977
- Strum: Structured Microprogram Development System for Correct FirmwareIEEE Transactions on Computers, 1976
- Data Flow Analysis in Software ReliabilityACM Computing Surveys, 1976
- Global Data Flow Analysis and Iterative AlgorithmsJournal of the ACM, 1976
- A Fast and Usually Linear Algorithm for Global Flow AnalysisJournal of the ACM, 1976
- A Simple Algorithm for Global Data Flow Analysis ProblemsSIAM Journal on Computing, 1975
- An empirical study of FORTRAN programsSoftware: Practice and Experience, 1971
- On the Minimization of READ-ONLY Memories in Microprogrammed Digital ComputersIEEE Transactions on Computers, 1970