Abstract
A new approach to resource conflict analysis in microcode compaction has been developed. This paper begins with a description of the resource binding problem in microcode compaction and an analysis of earlier solutions. Then a new specification technique is presented and related to a standard problem in combinatorial theory. This new technique allows microoperations to be specified with resource choices, the actual binding to specific resources being delayed until compaction time. A polynomial-time algorithm for analyzing resource conflicts under this model is explained. Further extensions to the algorithm to support more complex machine models are suggested.
- BRUA77 Brualdi, R. A.,
Introductory Combinatorics , North-Holland, New York, 1977.Google Scholar - COFF76 Coffman, E. G., Jr., ed.,
Computer and Job-Shop Scheduling Theory , New York: Wiley, 1976.Google Scholar - DAVI81a Davidson, S., D. Landskov, B. D. Shriver, and P. W. Mallett, "Some experiments in local microcode compaction for horizontal machines,"
IEEE Trans, Comput. C-30, 7 (July 81), 460--477. Google ScholarDigital Library
- DAVI81b Davidson, S., and B. D. Shriver, "Specifying target resources in a machine independent higher level language," in
AFIPS Conf. Proc. , Vol 50:1981 National Computer Conf. , AFIPS Press, Arlington, Va., 81--85.Google Scholar - FISH81a Fisher, J. A., "Trace scheduling: a technique for global microcode compaction,"
IEEE Trans. Comput. C-30, 7 (July 81), 478--490. Google ScholarDigital Library
- FISH81b Fisher, J. A., D. Landskov, and B. D. Shriver, "Microcode compaction: looking backward and looking forward," in
AFIPS Conf. Proc. , Vol 50:1981 National Computer Conf. , AFIPS Press, Arlington, Va., 95--102.Google Scholar - LAND80 Landskov, D., S. Davidson, B. Shriver, and P. W. Mallett, "Local microcode compaction techniques,"
Comput. Surv. , 12, 3 (Sept. 80), 261--294. Google ScholarDigital Library
- LAWL76 Lawler, E. L.,
Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.Google Scholar - MALL78 Mallett, P. W., "Methods of Compacting Microprograms," Ph.D. dissertation, Univ. of Southwestern Louisiana, Lafayette, Dec. 1978. Google Scholar
Digital Library
- MEND70 Mendelson, E.,
Theory and Problems of Switching Circuits. Schaum's Outline Series. New York: McGraw-Hill, 1970.Google Scholar - MIRS71 Mirsky, L.,
Transversal Theory , New York: Academic Press, 1971.Google Scholar - PAPA82 Papadimitriou, C. H., and K. Steiglitz,
Combinatorial Optimization: Algorithms and Complexity , Englewood Cliffs, NJ: Prentice Hall, 1982. Google ScholarDigital Library
- VEGD82 Vegdahl, S. R., "Local Code Generation and Compaction in Optimizing Microcode Compilers," Ph.D. dissertation, Carnegie-Mellon Univ., Dec. 1982. Google Scholar
Digital Library
- YAU74 Yau, S. S., A. C. Schowe, and M. Tsuchiya, "On storage optimization for horizontal microprograms," in
Proc, 7th Annual Workshop on Microprogramming , ACM, IEEE, New York, 1974, 98--106. Google ScholarDigital Library
Index Terms
(auto-classified)A resource request model for microcode compaction
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 ...
Issues of the design of a low level microprogramming language for global microcode compaction
MICRO 14: Proceedings of the 14th annual workshop on MicroprogrammingMicrocode compaction, or packing, is the process of assigning microoperations to microwords so that the minimum number of microwords and execution time is used by the microprogram. The techniques for global microcode compaction have been described ...






Comments