Abstract
The state of the art in microcode compaction is advancing. The classic problem of local (i.e. jump-free) compaction with a simplified machine model now has several solutions. Global (i.e. jumps-included) compaction is a current research topic. The trace compaction technique presented here is a promising approach to global compaction. The paper concludes with speculations about the near future of compaction research.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Davidson and B. D. Shriver, Firmware engineering: an extensive update, inInformatik-Fachberichte, Firmware Engineering, Vol. 31, pp. 25–71, Springer-Verlag, (1980).
F. Astopas and K. I. Plukas, Method of minimizing computer microprograms,Automatic Control (1971),5(4): 10–16.
C. V. Ramamoorthy and M. Tsuchiya, A high-level language for horizontal microprogramming,IEEE Trans. Comput. C23(8): 791–801, (August 1974).
D. Landskov, S. Davidson, B. Shriver and P. W. Mallett, Local microcode compaction techniques,Comput. Surv.,12(3): 261–294, (September 1980).
J. A. Fisher,The optimization of horizontal microcode within and beyond basic blocks: an application of processor scheduling with resources, U. S. Dept. of Energy Report, Mathematics and Computing COO-3077-161, New York Univ., (October 1979).
S. Davidson, D. Landskov, B. D. Shriver and P. W. Mallett, Some experiments in local microcode compaction for horizontal machines,IEEE Trans. Comput. C30(7): 460–477, (July 1981).
M. Tokoro, T. Takizuka, E. Tamura and I. Yamaura, A technique of global optimization of microprograms, inProc. 11th Annual Microprogramming Workshop, New York: IEEE, ACM, pp. 41–50, (1978).
J. A. Fisher, Trace scheduling: a technique for global microcode compaction,IEEE Trans. Comput. C30(7): 478–490, (July 1981).
R. Grishman and S. Bogong, A preliminary evaluation of trace scheduling for global microcode compaction. Report No. 042, Comp. Sci. Dept., New York Univ., (May 1982).
Proc. of the 16th Annual Microprogramming Workshop, New York: IEEE, ACM, (October 1983).
P. W. Mallett, Methods of compacting microprograms, Ph.D. dissertation, Univ. of Southwestern Louisiana, Lafayette, (December 1978).
S. R. Vegdahl, Local code generation and compaction in optimizing microcode compilers, Ph.D. dissertation, Carnegie-Mellon Univ., (December 1982).
D. J. DeWitt, A machine-independent approach to the production of horizontal microcode, Ph.D. dissertation, Univ. of Michigan, Ann Arbor,Tech. Rep. 76 DT4, (August 1976).
S. Dasgupta, The organization of microprogram stores,Comput. Surv. 11(1): 39–65 (March 1979).
A. V. Aho and J. D. Ullman,Principles of Compiler Design, Addison-Wesley, Reading, Massachusetts, (1977).
W. G. Wood, The computer aided design of microprograms, Ph.D. dissertation, Univ. of Edinburgh, Scotland, (1979).
D. A. Padua, D. J. Kuck and D. H. Lawrie, High-speed multiprocessors and compilation techniques,IEEE Trans. Comput. C29(9): 763–776, (September 1980).
D. D. Chamberlin, Parallel implementation of a single-assignment language, Ph.D. dissertation, Stanford Univ., (January 1971).
S. Davidson and B. D. Shriver, A solution to the resource binding problem, inProc. 1981 AFIPS National Computer Conf., AFIPS Press, Arlington, Virginia.
E. M. Riseman and C. C. Foster, The inhibition of potential parallelism by conditional jumps,IEEE Ttans. Comput. C21(12): 1405–1411, (December 1972).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Landskov, D., Fisher, J.A. & Shriver, B.D. Microcode compaction: Extending the boundaries. International Journal of Computer and Information Sciences 13, 1–21 (1984). https://doi.org/10.1007/BF00989480
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00989480