Abstract
The problem of compacting microcode has received considerable attention, but there remains much room for improvement. The major obstacle is the NP-completeness of the associated optimization problem and the coupling between code generation and compaction. Reduction operators are one form of heuristic technique that have been used effectively in scene analysis. By abstracting the microcode compaction problem as a constraint satisfaction problem, we can utilize some developed heuristic techniques. This approach is demonstrated along with experimental results obtained from a computer implementation. A comparison is made with several existing methods.
- Agerwala, T., "Microprogram optimization: A survey,"
IEEE Trans. Comp. C-25, 10 (Oct. 76), 962--973. Google ScholarDigital Library
- Astopas, F., and Plukas, K. "Method of minimizing computer microprograms,"
Automatic Control 5,4 (1971), 10--16.Google Scholar - Davidson, S., Landskov, D., Shriver, B., and Mallet, P., "Some experiments in Local Microcode Compaction for Horizontal Machines",
IEEE Trans, Comp. C-30,7 (July 81), p 460--477. Google ScholarDigital Library
- Dasgupta, S., and Tartar, J. "The Identification of Maximal Parallelism in Straight-Line Microprograms,"
IEEE Trans. Comp. C-25,10 (Oct. 76), 986--991. Google ScholarDigital Library
- Dasgupta, S. "Comment on the identification of maximal parallelism in straight-line microprograms,"
IEEE Trans. Comp. , C-27, 3 (March 78), 285--286. Google ScholarDigital Library
- Dewitt, D. "A Machine Independent Approach to the Production of optimal Horizontal Microcode," Ph.D. Dissertation, Univ. of Michigan, Ann Arbor, Tech. Rep 76. DT4, Aug. 1976. Google Scholar
Digital Library
- Fernandez, E. B; and Bussel, B. "Bounds on the number of processors and time for multiprocessor optimal schedule,"
IEEE Trans. Comp. C-22, 8 (Aug. 73) 745--751. Google ScholarDigital Library
- Fisher, J. A., The Optimization of Horizontal Microcode Within and Beyond Basic Blocks: An Application of Processor Scheduling with Resources, Ph.D. Thesis, Department of Mathematics and Computing, New York University, October 1979. Google Scholar
Digital Library
- Haralick, R., Davis, L., Rosenfeld, A., and Milgram, D., "Reduction Operations for Constraint Satisfaction",
Information Sciences 14, (1978) 199--219.Google ScholarCross Ref
- Haralick, R., and Shapiro, L., "The Consistent Labeling Problem: Part I",
IEEE Trans. on Pattern Analysis and Machine Intelligence , PAMI-1, No. 2, (April 79), 173--184. Google ScholarDigital Library
- Haralick, R., and Shapiro, L., "The Consistent Labeling Problem: Part II",
IEEE Trans. on Pattern Analysis and Machine Intelligence , PAMI-2, No. 3, (May 80), 193--203.Google Scholar - Haralick, R., and Elliot, G., "Increasing Tree Search Efficiency for Constraint Satisfaction Problems",
Artificial Intelligence 14 (1980), 263--313.Google ScholarCross Ref
- Henry, Steven G.,
Microprogram Compaction Using Reduction Operators , Masters Thesis, Department of Electrical Engineering, Colorado State University, July, 1983.Google Scholar - Kleir, R. L., and Ramamoorthy, C. V., "Optimization Strategies for Microprograms,"
IEEE Trans. Comp. C-20, 7 (July 71), 783--794. Google ScholarDigital Library
- Lewis, T., and Shriver B., "Introduction to Special Issue on Microprogramming Tools and Techniques",
IEEE Trans. Comp. , C-30,7 (July 81), 457--459. Google ScholarDigital Library
- Patterson, D., "V-Compiler: A next-generation tool for microprogramming",
National Computer Conference , (1981), 103--109).Google Scholar - Poe, M., "Heuristics for the Global Optimization of Microprograms", (SIGMICRO)
13th Annual Workshop on Microprogramming , (1980) 13--22. Google ScholarDigital Library
- Ramamoorthy, C. V.; and Tsuchiya, M., "A High-Level Language for Microprogramming,"
IEEE Trans. Comp. C-23,8 (Aug. 74), 791--801. Google ScholarDigital Library
- Tokoro, M., Tamura, E, Takase, K, and Tamaru, K., "An approach to microprogram optimization considering resource occupancy and instruction formats," in (SIGMICRO)
10th Annual Workshop on Microprogramming , (1977), 92--108. Google ScholarDigital Library
- Tokoru, M., Tamura, E., and Takizuka, T.; "Optimization of Microprograms",
IEEE Trans. Comp. C-30,7 (July 81), 491--504. Google ScholarDigital Library
- Tsuchiya, M., and Gonzalez, M. J., "An approach to optimization of horizontal microprograms," (SIGMICRO)
7th Annual workshop on microprogramming preprints (Sept. 30-Oct. 2, 1974) 85--90. Google ScholarDigital Library
- Tsuchiya, M., and Gonzalez, M., "Toward Optimization of Microprograms",
IEEE Trans. Comp. C-25,10 (Oct. 76) 992--999. Google ScholarDigital Library
- Vegdahl, S., Phase Coupling and Constant Generation in an Optimizing Microcode Compiler, Ph.D. Dissertation, Dept. of C.S., Carnagie-Mellon University, Dec. 1982.Google Scholar
- Yau, S. S., Schowe, A. C, and Tsuchiya, M. "On Storage Optimization of Horizontal Microprograms," (SIGMICRO)
7th Annual workshop on microprogramming preprints (Sept. 30-Oct. 2, 1974) 98--106. Google ScholarDigital Library
- Andrews, M,.
Principles of Firmware Engineering In Microprogram Control , Computer Science Press, Potomac, Maryland, 1980. Google ScholarDigital Library
- Garey, M., and Johnson, D.,
Computers and Intractibility: A Guide to the Theory of NP-Completeness , W.H. Freeman and Co., San Francisco, 1979. Google ScholarDigital Library
Recommendations
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 ...
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 ...






Comments