Abstract
Most of the discussion in the microprogram optimization literature deals only with straight line segments. This paper discusses an implementation in progress that globally optimizes microprograms. The complete optimization of microprograms has been shown to be very expensive computationally. However, the use of heuristics, such as those described in this paper, can efficiently approximate exhaustive optimization of microprograms.
- 1 Agerwala, T., Microprogram Optimization: A Survey, IEEE Transactions on Computers, Vol C-25, No. 10, October 1976, pages 962-973.Google Scholar
Digital Library
- 2 Aho, A. V., and Ullman, J. D., Principles of Compiler Design, Addison-Wesley, Reading, Massachusetts, 1977. Google Scholar
Digital Library
- 3 Coffman, E. G. Jr. (Ed.), Computer and Job-Shop Scheduling Theory, John Wiley and Sons, N. Y., N. Y., 1976.Google Scholar
- 4 Dasgupta, S., Parallelism in Loop-Free Microprograms, in Information Processing '77, North-Holland, 1977, pages 745-750.Google Scholar
- 5 Dewitt, D. J., A Machine Independent Approach to the Production of Optimized Horizontal Microcode, Ph.D. Thesis, Department of Computer, Information, and Control Engineering, University of Michigan, June 1976. Google Scholar
Digital Library
- 6 Fernandez, E. B., and Bussel, B., Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedule, IEEE Transactions on Computers, Vol C-22, No. 8, August 1973, pages 745-751.Google Scholar
Digital Library
- 7 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
- 8 Foster, C. C., and Riseman, E. M., Percolation of Code to Enhance Parallel Dispatching and Execution, IEEE Transactions on Computers, Vol C-21, No. 12, December 1972, pages 1411-1415.Google Scholar
Digital Library
- 9 Gries, D., Compiler Construction for Digital Computers, John Wiley and Sons, N. Y., N. Y., 1971. Google Scholar
Digital Library
- 10 Hecht, M. S., Flow Analysis of Computer Programs, Elsevier North-Holland, N. Y., N. Y., 1977. Google Scholar
Digital Library
- 11 Kleir, R. L., and Ramamoorthy, C. V., Optimization strategies for Microprograms, IEEE Transactions on Computers, Vol. C-20, No. 7, July 1971, pages 783-794.Google Scholar
- 12 Knuth, D. E., An Empirical Study of Fortran Programs, Software - Practice and Experience, Vol 1, 1971, pages 105-133.Google Scholar
- 13 Kuck, D. J., The Structure of Computers and Computations, Volume 1, John Wiley and Sons, New York, 1978. Google Scholar
Digital Library
- 14 Kuck, D. J. et. al., Measurements of Parallelism in Ordinary Fortran Programs, Computer, January 1974, pages 37-46.Google Scholar
Cross Ref
- 15 Kuck, D. J., Muraoka, Y., and Chen, S., On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup, IEEE Transactions on Computers, Vol C-21, No. 12, December 1972, pages 1293-1310.Google Scholar
Digital Library
- 16 Ma, Perng-Yi, Optimizing the Microcode Produced by a High Level Microprogramming Language, Ph.D. Thesis, Oregon State University, October 1978.Google Scholar
- 17 Mallett, P. W., Methods of Compacting Microprograms, Ph.D. Thesis, University of Southern Louisiana, December 1978. Google Scholar
Digital Library
- 18 Oakley, J. D., Symbolic Execution of Formal Machine Descriptions, Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, April 1979. Google Scholar
Digital Library
- 19 Riseman, E. M., and Foster, C. C., The Inhibition of Potential Parallelism by Conditional Jumps, IEEE Transactions on Computers, Vol C-21, No. 12, December 1972.Google Scholar
Digital Library
- 20 Sager, D., Digital Equipment Corporation, private communication, 1980.Google Scholar
- 21 Ullman, J. D., Polynomical Complete Scheduling Problem, in Fourth Symposium Operating System Principles, 1973, pages 96-101. Published in Operating System Review, Vol. 7, No. 4, ACM, N. Y., cited in Fisher, 1979. Google Scholar
Digital Library
- 22 Wood, G., On the Packing of Micro-operations into Microinstruction Words, Proceedings of the 11th Annual Workshow on Microprogramming, ACM, November 1978, pages 41-50. Google Scholar
Digital Library
- 23 Wood, G., Global Optimization of Microprograms Through Modular Control Constructs, Proceedings of the 12th Annual Workshow on Microprogramming, ACM, November 1979, pages 1-6. Google Scholar
Digital Library
- 24 Wulf, W., Johnson, R. K., Weinstock, C. B., Hobbs, S. O., Geschke, C. M., The Design of an Optimizing Compiler, Elsevier, New York, N. Y., 1975. Google Scholar
Digital Library
Index Terms
Heuristics for the global optimization of microprograms
Recommendations
Heuristics for the global optimization of microprograms
MICRO 13: Proceedings of the 13th annual workshop on MicroprogrammingMost of the discussion in the microprogram optimization literature deals only with straight line segments. This paper discusses an implementation in progress that globally optimizes microprograms. The complete optimization of microprograms has been ...
Optimization of Microprograms
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 ...
An enhanced particle swarm optimization with levy flight for global optimization
Enhanced PSO with levy flight.Random walk of the particles.High convergence rate.Provides solution accuracy and robust. Hüseyin Haklı and Harun Uguz (2014) proposed a novel approach for global function optimization using particle swarm optimization with ...






Comments