Abstract
Some comments are made concerning the generality and complexity of the classical microcode compaction problem. A trivial example is given that no classical compaction algorithm would compact optimally, because the computation of data precedence relations is dependent on the order of the source code. It is further argued that the classical compaction problem can be solved optimally in polynomial time, where the degree of the polynomial is dependent only on the micromachine architecture. We conclude that the most difficult portion of the microcode compaction problem is that of initially ordering the source code.
- {Fisher 79} Fisher, J. A. The Optimization of Horizontal Microcode Within and Beyond Basic Blocks: An Application of Processor Scheduling with Resources. PhD thesis, New York University, October, 1979. Google Scholar
Digital Library
- {Fisher 81} Fisher, J. A., Landskov, D. and Shriver, B. D. Microcode Compaction: Looking Backward and Forward. In Proc. 1981 National Computer Conference, pages 95--102. AFIPS, 1981.Google Scholar
Digital Library
- {Hillier 74} Hillier, F. S. and Lieberman, G. J. Introduction to Operations Research. Holden-Day, San Francisco, 1974. Google Scholar
Digital Library
- {Landskov 80} Landskov, D., Davidson, S., Shriver, B. and Mallett, P. W. Local Microcode Compaction Techniques. ACM Computing Surveys 12(3):261--294, September, 1980. Google Scholar
Digital Library
- {Mallett 78} Mallett, P. W. Methods of Compacting Microprograms. PhD thesis, University of Southwestern Louisiana, December, 1978. Google Scholar
Digital Library
- {Poe 81} Poe, M. D., Goodell, R. and Steely, S. Jr. Issues of the Design of a Low Level Microprogramming Language for Global Microcode Compaction. In Proc. 14th Annual Workshop on Microprogramming, pages 88--94. IEEE, October, 1981. Google Scholar
Digital Library
- {Vegdahl 82} Vegdahl, S. R. Local Code Generation and Compaction in Optimizing Microcode Compilers. PhD thesis, Carnegie-Mellon University, 1982. Google Scholar
Digital Library
- {Yau 74} Yau, S. S., Schowe, A. C. and Tsuchiya, M. On Storage Optimization of Horizontal Microprograms. In Proc. 7th Annual Workshop on Microprogramming, pages 98--106. IEEE, October, 1974. Google Scholar
Digital Library
Recommendations
Microcode compaction: looking backward and looking forward
AFIPS '81: Proceedings of the May 4-7, 1981, national computer conferenceThe 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 ...
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